//
// Created by ߳ on 2023/8/17.
//

#ifndef LEETCODE_SOLUTION68_H
#define LEETCODE_SOLUTION68_H
#include "bits/stdc++.h"
using namespace std;

class solution68 {
public:
    vector<int> exclusiveTime(int n, vector<string>& logs) {
        vector<int>result(n,0);
        vector<pair<int,int>>stack;
        for(auto log:logs){
            int pos1=log.find(":");
            int pos2=log.rfind(":");
            int  id=std::atoi(log.substr(0,pos1).c_str());
            string status=log.substr(pos1+1,pos2-pos1-1);
            int timestamp=std::atoi(log.substr(pos2+1,log.size()).c_str());
            pair<int,int>item= make_pair(id, timestamp);
            if(status=="start"){
                if(!stack.empty()){
                    result[stack.back().first]+=timestamp-stack.back().second;
                    stack.back().second=timestamp;
                }
                stack.emplace_back(item);
            }
            else{
                result[id]+=timestamp-stack.back().second+1;
                stack.pop_back();
                if(!stack.empty()){
                    stack.back().second=timestamp+1;
                }
            }
        }
        return result;
    }
};


#endif //LEETCODE_SOLUTION68_H