oj.uz

Submission #85788

# Submission time Handle Problem Language Result Execution time Memory
85788 2018-11-21T14:22:00 Z Vardanyan Trading (IZhO13_trading) C++14
100 / 100
 492 ms 54832 KB 
//#pragma GCC optimize "-O3"
#include <bits/stdc++.h>
using namespace std;
const int N = 300*1000+5;
vector<pair<int,int> > op[N];
vector<pair<int,int> > cl[N];
int a[N];
int main(){
    int n,m;
    scanf("%d%d",&n,&m);
    vector<pair<pair<int,int>,int > > v;
    for(int i = 0;i<m;i++){
        int l,r,x;
        scanf("%d%d%d",&l,&r,&x);
        op[l].push_back({x,i});
        cl[r].push_back({x,i});
        v.push_back({{l,r},x});
    }
    set<pair<int,int> > ms;
    for(int i = 1;i<=n;i++){
        for(int j = 0;j<op[i].size();j++){
                int id = op[i][j].first-i;
                ms.insert({id,op[i][j].second});
        }
        if(ms.size() == 0) continue;
        set<pair<int,int> >::iterator it = (--ms.end());
        pair<int,int> now = *it;
        a[i] = v[now.second].second+(i-v[now.second].first.first);
       // printf("%d ",a[i]);
        for(int j = 0;j<cl[i].size();j++){
            int id = cl[i][j].first-v[cl[i][j].second].first.first;
            ms.erase({id,cl[i][j].second});
        }
    }
    for(int i = 1;i<=n;i++) printf("%d ",a[i]);
    printf("\n");
	return 0;
}

Compilation message

trading.cpp: In function 'int main()':
trading.cpp:21:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j = 0;j<op[i].size();j++){
                       ~^~~~~~~~~~~~~
trading.cpp:30:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j = 0;j<cl[i].size();j++){
                       ~^~~~~~~~~~~~~
trading.cpp:10:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&m);
     ~~~~~^~~~~~~~~~~~~~
trading.cpp:14:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d",&l,&r,&x);
         ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 14456 KB Output is correct
2 Correct 14 ms 14456 KB Output is correct
3 Correct 16 ms 14536 KB Output is correct
4 Correct 15 ms 14744 KB Output is correct
5 Correct 18 ms 14832 KB Output is correct
6 Correct 18 ms 15000 KB Output is correct
7 Correct 236 ms 28820 KB Output is correct
8 Correct 247 ms 29792 KB Output is correct
9 Correct 266 ms 30284 KB Output is correct
10 Correct 306 ms 31128 KB Output is correct
11 Correct 302 ms 31664 KB Output is correct
12 Correct 345 ms 33692 KB Output is correct
13 Correct 383 ms 33692 KB Output is correct
14 Correct 381 ms 34124 KB Output is correct
15 Correct 385 ms 35152 KB Output is correct
16 Correct 400 ms 35196 KB Output is correct
17 Correct 404 ms 35392 KB Output is correct
18 Correct 421 ms 43576 KB Output is correct
19 Correct 422 ms 46008 KB Output is correct
20 Correct 492 ms 54832 KB Output is correct