oj.uz

Submission #21225

# Submission time Handle Problem Language Result Execution time Memory
21225 2017-04-11T01:14:05 Z jjwdi0 Trading (IZhO13_trading) C++11
100 / 100
 293 ms 20704 KB 
#include <bits/stdc++.h>
using namespace std;

struct Query {
    int s, e, v;
    Query() {}
    Query(int _s, int _e, int _v) { s = _s, e = _e, v = _v; }
    bool operator < (const Query &A) const { return v > A.v; }
}T[300005];

int N, Q;
int ans[300005];
set<int> s;

int main() {
    scanf("%d %d", &N, &Q);
    for(int i=0; i<Q; i++) scanf("%d %d %d", &T[i].s, &T[i].e, &T[i].v), T[i].v -= T[i].s;
    sort(T, T+Q);
    for(int i=1; i<=N; i++) ans[i] = -i, s.insert(i);
    for(int i=0; i<Q; i++) {
        auto it1 = s.lower_bound(T[i].s), it2 = s.upper_bound(T[i].e);
        for(auto iter = it1; iter != it2; iter++) ans[*iter] = T[i].v;
        s.erase(it1, it2);
    }
    for(int i=1; i<=N; i++) printf("%d ", ans[i] + i);
}

Compilation message

trading.cpp: In function 'int main()':
trading.cpp:16:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &N, &Q);
                           ^
trading.cpp:17:90: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i=0; i<Q; i++) scanf("%d %d %d", &T[i].s, &T[i].e, &T[i].v), T[i].v -= T[i].s;
                                                                                          ^

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 6712 KB Output is correct
2 Correct 0 ms 6712 KB Output is correct
3 Correct 0 ms 6712 KB Output is correct
4 Correct 0 ms 6712 KB Output is correct
5 Correct 0 ms 6844 KB Output is correct
6 Correct 0 ms 6844 KB Output is correct
7 Correct 143 ms 13708 KB Output is correct
8 Correct 149 ms 14500 KB Output is correct
9 Correct 153 ms 14896 KB Output is correct
10 Correct 176 ms 15688 KB Output is correct
11 Correct 169 ms 16480 KB Output is correct
12 Correct 189 ms 16612 KB Output is correct
13 Correct 219 ms 17404 KB Output is correct
14 Correct 229 ms 17800 KB Output is correct
15 Correct 236 ms 18460 KB Output is correct
16 Correct 259 ms 18724 KB Output is correct
17 Correct 249 ms 19120 KB Output is correct
18 Correct 279 ms 19384 KB Output is correct
19 Correct 269 ms 20044 KB Output is correct
20 Correct 293 ms 20704 KB Output is correct