# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
755605 | 2023-06-10T11:57:30 Z | Nika533 | Trading (IZhO13_trading) | C++17 | 336 ms | 35136 KB |
#pragma GCC diagnostic warning "-std=c++11" #include <bits/stdc++.h> #define int long long #define pb push_back #define f first #define s second #define MOD 1000000007 #define flush fflush(stdout) #define all(x) (x).begin(),(x).end() using namespace std; int n,m,T,k; string s; void test_case() { cin>>n>>m; pair<int,int> arr[m+1]; vector<int> l[n+1]; vector<int> r[n+1]; for (int i=1; i<=m; i++) { cin>>arr[i].f>>arr[i].s; int x; cin>>x; l[arr[i].f].pb(x-arr[i].f+1); r[arr[i].s].pb(x-arr[i].f+1); } int ans=0; multiset<int> myset; for (int i=1; i<=n; i++) { for (int j=0; j<l[i].size(); j++) { myset.insert(l[i][j]); } if (myset.size()==0) { cout<<0<<" "; continue; } set<int> :: iterator it = myset.end(); it--; cout<<(*it)+i-1<<" "; for (int j=0; j<r[i].size(); j++) { myset.erase(myset.find(r[i][j])); } } cout<<endl; } main () { ios :: sync_with_stdio(0); cin.tie(0); cout.tie(0); T=1; while (T--) { test_case(); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 340 KB | Output is correct |
4 | Correct | 1 ms | 340 KB | Output is correct |
5 | Correct | 2 ms | 468 KB | Output is correct |
6 | Correct | 3 ms | 596 KB | Output is correct |
7 | Correct | 160 ms | 18816 KB | Output is correct |
8 | Correct | 180 ms | 20344 KB | Output is correct |
9 | Correct | 152 ms | 21284 KB | Output is correct |
10 | Correct | 176 ms | 23220 KB | Output is correct |
11 | Correct | 196 ms | 24016 KB | Output is correct |
12 | Correct | 267 ms | 26684 KB | Output is correct |
13 | Correct | 215 ms | 26136 KB | Output is correct |
14 | Correct | 238 ms | 28096 KB | Output is correct |
15 | Correct | 265 ms | 29436 KB | Output is correct |
16 | Correct | 275 ms | 29756 KB | Output is correct |
17 | Correct | 336 ms | 30368 KB | Output is correct |
18 | Correct | 298 ms | 33600 KB | Output is correct |
19 | Correct | 247 ms | 31800 KB | Output is correct |
20 | Correct | 311 ms | 35136 KB | Output is correct |