# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
88595 | 2018-12-06T23:26:02 Z | amiratou | Roller Coaster Railroad (IOI16_railroad) | C++14 | 250 ms | 16132 KB |
#include <bits/stdc++.h> using namespace std; #define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0) #define debug(x) cerr << " - " << #x << ": " << x << endl; #define debugs(x, y) cerr << " - " << #x << ": " << x << " " << #y << ": " << y << endl; #define sep() cerr << "--------------------" << endl; #define all(x) (x).begin(),(x).end() #define sz(x) (ll)x.size() #define fi first #define se second #define ll long long #define ii pair<int,int> #define v vector<int> #define vv vector<vector<int> > #define pb push_back #define INF 15 using namespace std; set<pair<ll,ll> > myset; long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) { int n = (int) s.size(); ll maxi,maxval=0,mini,minval=INT_MAX; for (int i = 0; i < n; ++i) { myset.insert({s[i],i}); if(minval>s[i]){ minval=s[i]; mini=i; } if(maxval<t[i]){ maxval=t[i]; maxi=i; } } if(maxi==mini){ auto temp=myset.begin(); temp++; mini=temp->se; } myset.erase(myset.find({s[mini],mini})); myset.erase(myset.find({s[maxi],maxi})); int curr=t[mini]; while(!myset.empty()){ //debug(curr); auto search=myset.lower_bound({curr,0}); if(search==myset.end())return INF; auto it=myset.end(); it--; if(search!=it&&search->fi!=curr) search++; curr=t[search->se]; myset.erase(search); } //debug(curr); if(curr<=s[maxi]) return 0; return INF; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | n = 2 |
2 | Correct | 2 ms | 372 KB | n = 2 |
3 | Correct | 2 ms | 576 KB | n = 2 |
4 | Correct | 2 ms | 584 KB | n = 2 |
5 | Correct | 2 ms | 584 KB | n = 2 |
6 | Incorrect | 2 ms | 584 KB | answer is not correct: 15 instead of 523688153 |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | n = 2 |
2 | Correct | 2 ms | 372 KB | n = 2 |
3 | Correct | 2 ms | 576 KB | n = 2 |
4 | Correct | 2 ms | 584 KB | n = 2 |
5 | Correct | 2 ms | 584 KB | n = 2 |
6 | Incorrect | 2 ms | 584 KB | answer is not correct: 15 instead of 523688153 |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 250 ms | 16132 KB | answer is not correct: 1 instead of 0 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | n = 2 |
2 | Correct | 2 ms | 372 KB | n = 2 |
3 | Correct | 2 ms | 576 KB | n = 2 |
4 | Correct | 2 ms | 584 KB | n = 2 |
5 | Correct | 2 ms | 584 KB | n = 2 |
6 | Incorrect | 2 ms | 584 KB | answer is not correct: 15 instead of 523688153 |
7 | Halted | 0 ms | 0 KB | - |