oj.uz

Submission #88586

# Submission time Handle Problem Language Result Execution time Memory
88586 2018-12-06T22:00:47 Z amiratou Roller Coaster Railroad (IOI16_railroad) C++14
0 / 100
 2000 ms 17716 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 LLONG_MAX
using namespace std;
vector<int> limit,exitsp;
int n;
set<pair<int,int> > myset;
bool check(ll curr){
	while(!myset.empty()){
		/*debug(curr);
		for(auto it:myset)
			cout<<it.fi<<" "<<it.se<<"\n";
		sep()*/
		auto search=myset.upper_bound({curr,0});
		if(search==myset.end())return 0;
		//debug(search->fi);
		if(search!=myset.begin()){
			search--;
			if(search->fi<curr)
				search++;
		}
		curr=exitsp[search->se];
		myset.erase(search);
	}
	return 1;
}
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    n = (int) s.size();
    exitsp=t;
    for (int i = 0; i < n; ++i)
    	myset.insert({s[i],i});
    for (int i = 0; i < n; ++i)
    {
    	//debug(i);
    	myset.erase(myset.find({s[i],i}));
    	if(check(t[i]))
    		return 0;
    	myset.clear();
    	for (int j = 0; j < n; ++j)
    		myset.insert({s[j],j});
    }
    return INF-5;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB n = 2
2 Correct 2 ms 356 KB n = 2
3 Correct 2 ms 416 KB n = 2
4 Correct 2 ms 588 KB n = 2
5 Correct 2 ms 588 KB n = 2
6 Incorrect 2 ms 588 KB answer is not correct: 9223372036854775802 instead of 523688153
7 Halted 0 ms 0 KB -

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB n = 2
2 Correct 2 ms 356 KB n = 2
3 Correct 2 ms 416 KB n = 2
4 Correct 2 ms 588 KB n = 2
5 Correct 2 ms 588 KB n = 2
6 Incorrect 2 ms 588 KB answer is not correct: 9223372036854775802 instead of 523688153
7 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 222 ms 13800 KB n = 199999
2 Execution timed out 2069 ms 17716 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB n = 2
2 Correct 2 ms 356 KB n = 2
3 Correct 2 ms 416 KB n = 2
4 Correct 2 ms 588 KB n = 2
5 Correct 2 ms 588 KB n = 2
6 Incorrect 2 ms 588 KB answer is not correct: 9223372036854775802 instead of 523688153
7 Halted 0 ms 0 KB -