oj.uz

Submission #969710

# Submission time Handle Problem Language Result Execution time Memory
969710 2024-04-25T13:32:15 Z SeenSiravit Trading (IZhO13_trading) C++14
100 / 100
 416 ms 35272 KB 
#include<bits/stdc++.h>
#define ll long long
#define ar array

using namespace std;

const int mxN = 3e5 + 5;
int n,m;
ar<int,3> t[mxN];
ll ans[mxN];
vector<int> st[mxN] , en[mxN];

int main(){

    cin>> n >> m;

    for(int i=1;i<=m;i++){
        cin>> t[i][1] >> t[i][0] >> t[i][2];
        t[i][2] = t[i][2] - t[i][1];

        st[t[i][1]].push_back(i);
        en[t[i][0]+1].push_back(i);
    }


    set<ar<int , 2>> s;

    for(int i=1;i<=n;i++){
        for(auto idx : st[i]) s.insert({t[idx][2] , idx});
        for(auto idx : en[i]) s.erase({t[idx][2] , idx});

        ans[i] = (s.empty() ? 0 : (*s.rbegin())[0] + i);
    }

    for(int i=1;i<=n;i++) cout<< ans[i] << " ";

    return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 16988 KB Output is correct
2 Correct 4 ms 16988 KB Output is correct
3 Correct 4 ms 16988 KB Output is correct
4 Correct 5 ms 16984 KB Output is correct
5 Correct 5 ms 16984 KB Output is correct
6 Correct 7 ms 16988 KB Output is correct
7 Correct 190 ms 27472 KB Output is correct
8 Correct 190 ms 27980 KB Output is correct
9 Correct 222 ms 28120 KB Output is correct
10 Correct 219 ms 28972 KB Output is correct
11 Correct 236 ms 29264 KB Output is correct
12 Correct 261 ms 31176 KB Output is correct
13 Correct 290 ms 30284 KB Output is correct
14 Correct 261 ms 31424 KB Output is correct
15 Correct 331 ms 32136 KB Output is correct
16 Correct 311 ms 32292 KB Output is correct
17 Correct 334 ms 32676 KB Output is correct
18 Correct 331 ms 35272 KB Output is correct
19 Correct 365 ms 32832 KB Output is correct
20 Correct 416 ms 35160 KB Output is correct