oj.uz

답안 #1064328

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1064328 2024-08-18T11:29:18 Z beaconmc Brought Down the Grading Server? (CEOI23_balance) C++14
25 / 100
 387 ms 34752 KB 
#include <bits/stdc++.h>
 
typedef long long ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)
 
using namespace std;


map<ll,ll> sus;
map<ll,ll> sus2;
map<ll,ll> cnts;


set<vector<ll>> stuff[100005];

int main(){

	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	ll n,s,t;
	cin >> n >> s >> t;
	vector<vector<ll>> cores;
	vector<vector<ll>> orient(n);


	FOR(i,0,n){
		ll a,b;
		cin >> a >> b;
		if (a==b){
			orient[i] = {a,b};
			continue;
		}
		cores.push_back({a,b});
		stuff[a].insert({b,i});
		stuff[b].insert({a,i});
	}

	ll cnt = 1;
	vector<ll> urg;
	FOR(i,1,n+1) if (stuff[i].size()==1) urg.push_back(i);


	while (cnt < n){
		if (stuff[cnt].size()==0) cnt++;
		ll cur = cnt;

		while (urg.size() && stuff[urg[urg.size()-1]].size() != 1) urg.pop_back();

		if (urg.size()){
			cur = urg[urg.size()-1];
			urg.pop_back();
		}


		while (1){
			if (stuff[cur].size()==0) break;

			vector<ll> node = (*stuff[cur].begin());

			orient[node[1]] = {cur, node[0]};
			stuff[cur].erase(node);
			stuff[node[0]].erase({cur, node[1]});

			if (stuff[cur].size() == 1) urg.push_back(cur);
			if (stuff[node[0]].size() == 1) urg.push_back(node[0]);

			cur = node[0];


			if (cur == cnt) break;
		}
	}
	for (auto&i : orient){
		sus[i[0]]++;
		sus2[i[1]]++;
		cout << i[0] << " " << i[1] << endl;
	}
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4956 KB Correct
2 Incorrect 2 ms 4956 KB Unexpected end of file - int32 expected
3 Halted 0 ms 0 KB -

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4956 KB Correct
2 Correct 2 ms 4956 KB Correct
3 Correct 2 ms 4956 KB Correct
4 Correct 2 ms 4956 KB Correct
5 Correct 2 ms 4956 KB Correct
6 Correct 2 ms 4996 KB Correct
7 Correct 2 ms 4956 KB Correct

Subtask #2-1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 302 ms 33540 KB Correct
2 Correct 273 ms 32732 KB Correct
3 Correct 233 ms 30096 KB Correct
4 Correct 197 ms 29700 KB Correct
5 Correct 250 ms 32768 KB Correct
6 Correct 310 ms 33540 KB Correct
7 Correct 301 ms 32768 KB Correct
8 Correct 264 ms 34668 KB Correct
9 Correct 251 ms 34560 KB Correct
10 Correct 187 ms 34664 KB Correct
11 Correct 184 ms 34540 KB Correct

Subtask #2-2
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 302 ms 33540 KB Correct
2 Correct 273 ms 32732 KB Correct
3 Correct 233 ms 30096 KB Correct
4 Correct 197 ms 29700 KB Correct
5 Correct 250 ms 32768 KB Correct
6 Correct 310 ms 33540 KB Correct
7 Correct 301 ms 32768 KB Correct
8 Correct 264 ms 34668 KB Correct
9 Correct 251 ms 34560 KB Correct
10 Correct 187 ms 34664 KB Correct
11 Correct 184 ms 34540 KB Correct
12 Correct 310 ms 33532 KB Correct
13 Correct 281 ms 32824 KB Correct
14 Correct 285 ms 30088 KB Correct
15 Correct 198 ms 29692 KB Correct
16 Correct 296 ms 32772 KB Correct
17 Correct 347 ms 33540 KB Correct
18 Correct 387 ms 32764 KB Correct
19 Correct 288 ms 34644 KB Correct
20 Correct 331 ms 34632 KB Correct
21 Correct 187 ms 34752 KB Correct
22 Correct 215 ms 34516 KB Correct
23 Incorrect 315 ms 33536 KB maximum and minimum number of simultaneously evaluated submissions for any single task differ more than one
24 Halted 0 ms 0 KB -

Subtask #2-3
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4956 KB Correct
2 Correct 2 ms 4956 KB Correct
3 Correct 2 ms 4956 KB Correct
4 Correct 2 ms 4956 KB Correct
5 Correct 2 ms 4956 KB Correct
6 Correct 2 ms 4996 KB Correct
7 Correct 2 ms 4956 KB Correct
8 Correct 302 ms 33540 KB Correct
9 Correct 273 ms 32732 KB Correct
10 Correct 233 ms 30096 KB Correct
11 Correct 197 ms 29700 KB Correct
12 Correct 250 ms 32768 KB Correct
13 Correct 310 ms 33540 KB Correct
14 Correct 301 ms 32768 KB Correct
15 Correct 264 ms 34668 KB Correct
16 Correct 251 ms 34560 KB Correct
17 Correct 187 ms 34664 KB Correct
18 Correct 184 ms 34540 KB Correct
19 Correct 310 ms 33532 KB Correct
20 Correct 281 ms 32824 KB Correct
21 Correct 285 ms 30088 KB Correct
22 Correct 198 ms 29692 KB Correct
23 Correct 296 ms 32772 KB Correct
24 Correct 347 ms 33540 KB Correct
25 Correct 387 ms 32764 KB Correct
26 Correct 288 ms 34644 KB Correct
27 Correct 331 ms 34632 KB Correct
28 Correct 187 ms 34752 KB Correct
29 Correct 215 ms 34516 KB Correct
30 Incorrect 315 ms 33536 KB maximum and minimum number of simultaneously evaluated submissions for any single task differ more than one
31 Halted 0 ms 0 KB -

Subtask #3-1
0.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 4956 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #3-2
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 4956 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #3-3
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 4956 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #4-1
0.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 302 ms 33540 KB Correct
2 Correct 273 ms 32732 KB Correct
3 Correct 233 ms 30096 KB Correct
4 Correct 197 ms 29700 KB Correct
5 Correct 250 ms 32768 KB Correct
6 Correct 310 ms 33540 KB Correct
7 Correct 301 ms 32768 KB Correct
8 Correct 264 ms 34668 KB Correct
9 Correct 251 ms 34560 KB Correct
10 Correct 187 ms 34664 KB Correct
11 Correct 184 ms 34540 KB Correct
12 Incorrect 2 ms 4956 KB Unexpected end of file - int32 expected
13 Halted 0 ms 0 KB -

Subtask #4-2
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 302 ms 33540 KB Correct
2 Correct 273 ms 32732 KB Correct
3 Correct 233 ms 30096 KB Correct
4 Correct 197 ms 29700 KB Correct
5 Correct 250 ms 32768 KB Correct
6 Correct 310 ms 33540 KB Correct
7 Correct 301 ms 32768 KB Correct
8 Correct 264 ms 34668 KB Correct
9 Correct 251 ms 34560 KB Correct
10 Correct 187 ms 34664 KB Correct
11 Correct 184 ms 34540 KB Correct
12 Correct 310 ms 33532 KB Correct
13 Correct 281 ms 32824 KB Correct
14 Correct 285 ms 30088 KB Correct
15 Correct 198 ms 29692 KB Correct
16 Correct 296 ms 32772 KB Correct
17 Correct 347 ms 33540 KB Correct
18 Correct 387 ms 32764 KB Correct
19 Correct 288 ms 34644 KB Correct
20 Correct 331 ms 34632 KB Correct
21 Correct 187 ms 34752 KB Correct
22 Correct 215 ms 34516 KB Correct
23 Incorrect 315 ms 33536 KB maximum and minimum number of simultaneously evaluated submissions for any single task differ more than one
24 Halted 0 ms 0 KB -

Subtask #4-3
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4956 KB Correct
2 Incorrect 2 ms 4956 KB Unexpected end of file - int32 expected
3 Halted 0 ms 0 KB -