oj.uz

답안 #722562

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
722562 2023-04-12T09:49:18 Z ymm Roller Coaster Railroad (IOI16_railroad) C++17
0 / 100
 274 ms 17096 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;
	int ds;
	vector<pii> vec;
	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;
				ds = is;
				break;
			}
			int j = p->second;
			S.erase(p);
			it = t[j];
			vec.push_back({it, is});
		}
	}
	if (cnt > 1)
		return 1;
	if (cnt == 0)
		return 0;
	sort(vec.begin(), vec.end());
	for (auto [x, y] : vec) {
		if (x > ds)
			return 1;
		ds = max(ds, y);
	}
	return 0;
}

Compilation message

railroad.cpp: In function 'long long int plan_roller_coaster(std::vector<int>, std::vector<int>)':
railroad.cpp:17:6: warning: 'ds' may be used uninitialized in this function [-Wmaybe-uninitialized]
   17 |  int ds;
      |      ^~

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB n = 2
2 Correct 1 ms 300 KB n = 2
3 Correct 1 ms 212 KB n = 2
4 Correct 1 ms 304 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB n = 2
2 Correct 1 ms 300 KB n = 2
3 Correct 1 ms 212 KB n = 2
4 Correct 1 ms 304 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

# 결과 실행 시간 메모리 Grader output
1 Correct 148 ms 13284 KB n = 199999
2 Correct 274 ms 15244 KB n = 199991
3 Correct 192 ms 17096 KB n = 199993
4 Correct 131 ms 12432 KB n = 152076
5 Correct 83 ms 7980 KB n = 93249
6 Correct 185 ms 16000 KB n = 199910
7 Correct 151 ms 16476 KB n = 199999
8 Correct 163 ms 16020 KB n = 199997
9 Correct 181 ms 14680 KB n = 171294
10 Incorrect 114 ms 11940 KB answer is not correct: 1 instead of 0
11 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB n = 2
2 Correct 1 ms 300 KB n = 2
3 Correct 1 ms 212 KB n = 2
4 Correct 1 ms 304 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 -