oj.uz

Submission #969688

# Submission time Handle Problem Language Result Execution time Memory
969688 2024-04-25T13:08:30 Z SeenSiravit Trading (IZhO13_trading) C++14
100 / 100
 412 ms 41280 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 3 ms 16984 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 16988 KB Output is correct
5 Correct 6 ms 16988 KB Output is correct
6 Correct 6 ms 16988 KB Output is correct
7 Correct 192 ms 30496 KB Output is correct
8 Correct 203 ms 31184 KB Output is correct
9 Correct 195 ms 31364 KB Output is correct
10 Correct 220 ms 32584 KB Output is correct
11 Correct 233 ms 33096 KB Output is correct
12 Correct 271 ms 35480 KB Output is correct
13 Correct 257 ms 34440 KB Output is correct
14 Correct 276 ms 35524 KB Output is correct
15 Correct 332 ms 36888 KB Output is correct
16 Correct 324 ms 37296 KB Output is correct
17 Correct 307 ms 37444 KB Output is correct
18 Correct 355 ms 40644 KB Output is correct
19 Correct 326 ms 37868 KB Output is correct
20 Correct 412 ms 41280 KB Output is correct