oj.uz

답안 #1064321

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1064321 2024-08-18T11:26:41 Z beaconmc Brought Down the Grading Server? (CEOI23_balance) C++14
25 / 100
 329 ms 35840 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[100000];

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;
	}
	// cout << endl;

	// FOR(i,1,t+1){
	// 	cout << sus[i] << " " << sus2[i] << endl;
	// }






}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4952 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 4952 KB Correct
2 Correct 3 ms 5068 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 4956 KB Correct
7 Correct 2 ms 4908 KB Correct

Subtask #2-1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 323 ms 33696 KB Correct
2 Correct 252 ms 33796 KB Correct
3 Correct 242 ms 31068 KB Correct
4 Correct 193 ms 30204 KB Correct
5 Correct 275 ms 34052 KB Correct
6 Correct 329 ms 34908 KB Correct
7 Correct 296 ms 33792 KB Correct
8 Correct 266 ms 35836 KB Correct
9 Correct 261 ms 35580 KB Correct
10 Correct 192 ms 35840 KB Correct
11 Correct 193 ms 35776 KB Correct

Subtask #2-2
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 323 ms 33696 KB Correct
2 Correct 252 ms 33796 KB Correct
3 Correct 242 ms 31068 KB Correct
4 Correct 193 ms 30204 KB Correct
5 Correct 275 ms 34052 KB Correct
6 Correct 329 ms 34908 KB Correct
7 Correct 296 ms 33792 KB Correct
8 Correct 266 ms 35836 KB Correct
9 Correct 261 ms 35580 KB Correct
10 Correct 192 ms 35840 KB Correct
11 Correct 193 ms 35776 KB Correct
12 Correct 295 ms 34784 KB Correct
13 Correct 269 ms 33852 KB Correct
14 Correct 242 ms 31036 KB Correct
15 Correct 200 ms 30076 KB Correct
16 Correct 266 ms 34048 KB Correct
17 Correct 323 ms 34708 KB Correct
18 Correct 301 ms 33788 KB Correct
19 Correct 273 ms 35732 KB Correct
20 Correct 269 ms 35580 KB Correct
21 Correct 190 ms 35836 KB Correct
22 Correct 193 ms 35584 KB Correct
23 Incorrect 296 ms 34820 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 4952 KB Correct
2 Correct 3 ms 5068 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 4956 KB Correct
7 Correct 2 ms 4908 KB Correct
8 Correct 323 ms 33696 KB Correct
9 Correct 252 ms 33796 KB Correct
10 Correct 242 ms 31068 KB Correct
11 Correct 193 ms 30204 KB Correct
12 Correct 275 ms 34052 KB Correct
13 Correct 329 ms 34908 KB Correct
14 Correct 296 ms 33792 KB Correct
15 Correct 266 ms 35836 KB Correct
16 Correct 261 ms 35580 KB Correct
17 Correct 192 ms 35840 KB Correct
18 Correct 193 ms 35776 KB Correct
19 Correct 295 ms 34784 KB Correct
20 Correct 269 ms 33852 KB Correct
21 Correct 242 ms 31036 KB Correct
22 Correct 200 ms 30076 KB Correct
23 Correct 266 ms 34048 KB Correct
24 Correct 323 ms 34708 KB Correct
25 Correct 301 ms 33788 KB Correct
26 Correct 273 ms 35732 KB Correct
27 Correct 269 ms 35580 KB Correct
28 Correct 190 ms 35836 KB Correct
29 Correct 193 ms 35584 KB Correct
30 Incorrect 296 ms 34820 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 323 ms 33696 KB Correct
2 Correct 252 ms 33796 KB Correct
3 Correct 242 ms 31068 KB Correct
4 Correct 193 ms 30204 KB Correct
5 Correct 275 ms 34052 KB Correct
6 Correct 329 ms 34908 KB Correct
7 Correct 296 ms 33792 KB Correct
8 Correct 266 ms 35836 KB Correct
9 Correct 261 ms 35580 KB Correct
10 Correct 192 ms 35840 KB Correct
11 Correct 193 ms 35776 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 323 ms 33696 KB Correct
2 Correct 252 ms 33796 KB Correct
3 Correct 242 ms 31068 KB Correct
4 Correct 193 ms 30204 KB Correct
5 Correct 275 ms 34052 KB Correct
6 Correct 329 ms 34908 KB Correct
7 Correct 296 ms 33792 KB Correct
8 Correct 266 ms 35836 KB Correct
9 Correct 261 ms 35580 KB Correct
10 Correct 192 ms 35840 KB Correct
11 Correct 193 ms 35776 KB Correct
12 Correct 295 ms 34784 KB Correct
13 Correct 269 ms 33852 KB Correct
14 Correct 242 ms 31036 KB Correct
15 Correct 200 ms 30076 KB Correct
16 Correct 266 ms 34048 KB Correct
17 Correct 323 ms 34708 KB Correct
18 Correct 301 ms 33788 KB Correct
19 Correct 273 ms 35732 KB Correct
20 Correct 269 ms 35580 KB Correct
21 Correct 190 ms 35836 KB Correct
22 Correct 193 ms 35584 KB Correct
23 Incorrect 296 ms 34820 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 4952 KB Correct
2 Incorrect 2 ms 4956 KB Unexpected end of file - int32 expected
3 Halted 0 ms 0 KB -