oj.uz

답안 #848425

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
848425 2023-09-12T15:07:36 Z Darren0724 거래 (IZhO13_trading) C++17
100 / 100
 308 ms 26704 KB 
#include <bits/stdc++.h>
using namespace std;
struct info{
    int c,l,r;
};
int32_t main() {
    int n,m;cin>>n>>m;
    vector<info> v(m);
    set<int> s;
    for(int i=1;i<=n;i++){
        s.insert(i);
    }
    for(int i=0;i<m;i++){
        cin>>v[i].l>>v[i].r>>v[i].c;
    }
    sort(v.begin(),v.end(),[](info &a,info &b){return a.c-a.l>b.c-b.l;});
    vector<int> ans(n+1);
    for(int i=0;i<m;i++){
        auto it=s.lower_bound(v[i].l);
        while(it!=s.end()&&*it<=v[i].r){
            ans[*it]=v[i].c+*it-v[i].l;
            s.erase(it);
            it=s.lower_bound(v[i].l);
        }
    }
    for(int i=1;i<=n;i++){
        cout<<ans[i]<<' ';
    }
    cout<<endl;
    
    
    return 0;
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 3 ms 600 KB Output is correct
7 Correct 152 ms 13460 KB Output is correct
8 Correct 168 ms 15184 KB Output is correct
9 Correct 171 ms 15440 KB Output is correct
10 Correct 208 ms 16648 KB Output is correct
11 Correct 198 ms 18228 KB Output is correct
12 Correct 213 ms 18768 KB Output is correct
13 Correct 219 ms 20064 KB Output is correct
14 Correct 228 ms 20304 KB Output is correct
15 Correct 259 ms 22016 KB Output is correct
16 Correct 297 ms 22608 KB Output is correct
17 Correct 259 ms 22992 KB Output is correct
18 Correct 271 ms 23916 KB Output is correct
19 Correct 285 ms 24400 KB Output is correct
20 Correct 308 ms 26704 KB Output is correct