oj.uz

Submission #722552

# Submission time Handle Problem Language Result Execution time Memory
722552 2023-04-12T09:36:07 Z ymm Roller Coaster Railroad (IOI16_railroad) C++17
0 / 100
 230 ms 16688 KB 
#include "railroad.h"
#include <bits/stdc++.h>
#define Loop(x,l,r) for (ll x = (l); x < (ll)(r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (ll)(l); --x)
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll , ll > pll;
using namespace std;

long long plan_roller_coaster(std::vector<int> s, std::vector<int> t)
{
	int n = s.size();
	set<pii> S;
	Loop (i,0,n)
		S.insert({s[i], i});
	int cnt = 0;
	while (S.size()) {
		int i = S.begin()->second;
		int is = s[i], it = t[i];
		S.erase(S.begin());
		while (is < it) {
			auto p = S.lower_bound(pii{it, INT_MIN});
			if (p == S.end()) {
				++cnt;
				break;
			}
			int j = p->second;
			S.erase(p);
			it = t[j];
		}
	}
	return cnt > 1;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 2
2 Correct 1 ms 304 KB n = 2
3 Correct 1 ms 300 KB n = 2
4 Correct 1 ms 212 KB n = 2
5 Correct 1 ms 212 KB n = 2
6 Incorrect 1 ms 212 KB answer is not correct: 1 instead of 523688153
7 Halted 0 ms 0 KB -

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 2
2 Correct 1 ms 304 KB n = 2
3 Correct 1 ms 300 KB n = 2
4 Correct 1 ms 212 KB n = 2
5 Correct 1 ms 212 KB n = 2
6 Incorrect 1 ms 212 KB answer is not correct: 1 instead of 523688153
7 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 143 ms 12752 KB n = 199999
2 Correct 230 ms 16688 KB n = 199991
3 Correct 221 ms 16580 KB n = 199993
4 Correct 116 ms 12492 KB n = 152076
5 Correct 96 ms 8012 KB n = 93249
6 Correct 151 ms 15532 KB n = 199910
7 Correct 158 ms 15932 KB n = 199999
8 Correct 168 ms 15592 KB n = 199997
9 Correct 194 ms 14188 KB n = 171294
10 Correct 104 ms 11704 KB n = 140872
11 Incorrect 175 ms 15460 KB answer is not correct: 0 instead of 1
12 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 2
2 Correct 1 ms 304 KB n = 2
3 Correct 1 ms 300 KB n = 2
4 Correct 1 ms 212 KB n = 2
5 Correct 1 ms 212 KB n = 2
6 Incorrect 1 ms 212 KB answer is not correct: 1 instead of 523688153
7 Halted 0 ms 0 KB -