oj.uz

답안 #973007

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
973007 2024-05-01T12:10:55 Z vjudge1 거래 (IZhO13_trading) C++14
100 / 100
 468 ms 41284 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

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 16988 KB Output is correct
2 Correct 4 ms 17040 KB Output is correct
3 Correct 5 ms 16988 KB Output is correct
4 Correct 5 ms 16988 KB Output is correct
5 Correct 6 ms 17040 KB Output is correct
6 Correct 6 ms 17240 KB Output is correct
7 Correct 177 ms 30200 KB Output is correct
8 Correct 191 ms 31364 KB Output is correct
9 Correct 212 ms 31744 KB Output is correct
10 Correct 218 ms 32584 KB Output is correct
11 Correct 224 ms 33320 KB Output is correct
12 Correct 266 ms 35248 KB Output is correct
13 Correct 257 ms 34756 KB Output is correct
14 Correct 274 ms 35644 KB Output is correct
15 Correct 290 ms 36940 KB Output is correct
16 Correct 322 ms 37320 KB Output is correct
17 Correct 324 ms 37504 KB Output is correct
18 Correct 367 ms 40560 KB Output is correct
19 Correct 468 ms 37988 KB Output is correct
20 Correct 419 ms 41284 KB Output is correct