oj.uz

Submission #668834

# Submission time Handle Problem Language Result Execution time Memory
668834 2022-12-05T04:00:36 Z Astrayt Scales (IOI15_scales) C++17
6.84932 / 100
 1 ms 272 KB 
#include <bits/stdc++.h>
#include "scales.h"
using namespace std;
#define pb push_back
#define ll long long
#define pii pair<int,int>
#define All(x) x.begin(), x.end()

vector<int> adj[7];
int t, deg[7];

void init(int T){
	t = T;
   	for(int i = 1; i <= 6; ++i) deg[i] = 0;
}

void orderCoins(){
   	for(int i = 1; i <= 6; ++i){
   		adj[i].clear();
   	}
   	for(int i = 1; i <= 6; ++i){
   		for(int j = i + 1; j <= 6; ++j){
   			for(int k = j + 1; k <= 6; ++k){
   				int a = getHeaviest(i, j, k), b = getMedian(i, j, k), c;
   				if((a == i && b == j) || (a == j && b == i)) c = k;
   				else if((a == i && b == k) ||( a == k && b == i)) c = j;
   				else c = i;
   				adj[a].pb(b), adj[b].pb(c);
   				deg[b]++, deg[c]++;
   			}
   		}
   	}
   	queue<int> bfs;
   	vector<int> top;
	for(int i = 1; i <= 6; ++i){
   		if(deg[i] == 0) bfs.push(i);
	}
	while(bfs.size()){
		int u = bfs.front();
		bfs.pop();
		top.pb(u);
		for(auto v:adj[u]){
			deg[v]--;
			if(deg[v] == 0) bfs.push(v);
		}
	}
	reverse(top.begin(), top.end());
	int ans[6];
	for(int i = 0; i < 6; ++i) ans[i] = top[i];
	answer(ans);
	return;
}

Subtask #1
6.849315 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 212 KB Output is partially correct
2 Partially correct 0 ms 212 KB Output is partially correct
3 Partially correct 1 ms 212 KB Output is partially correct
4 Partially correct 0 ms 212 KB Output is partially correct
5 Partially correct 0 ms 212 KB Output is partially correct
6 Partially correct 0 ms 212 KB Output is partially correct
7 Partially correct 1 ms 212 KB Output is partially correct
8 Partially correct 0 ms 212 KB Output is partially correct
9 Partially correct 1 ms 212 KB Output is partially correct
10 Partially correct 0 ms 212 KB Output is partially correct
11 Partially correct 0 ms 212 KB Output is partially correct
12 Partially correct 0 ms 212 KB Output is partially correct
13 Partially correct 0 ms 212 KB Output is partially correct
14 Partially correct 0 ms 212 KB Output is partially correct
15 Partially correct 0 ms 212 KB Output is partially correct
16 Partially correct 0 ms 212 KB Output is partially correct
17 Partially correct 0 ms 212 KB Output is partially correct
18 Partially correct 0 ms 212 KB Output is partially correct
19 Partially correct 0 ms 212 KB Output is partially correct
20 Partially correct 1 ms 212 KB Output is partially correct
21 Partially correct 1 ms 212 KB Output is partially correct
22 Partially correct 0 ms 212 KB Output is partially correct
23 Partially correct 0 ms 212 KB Output is partially correct
24 Partially correct 0 ms 212 KB Output is partially correct
25 Partially correct 0 ms 212 KB Output is partially correct
26 Partially correct 0 ms 212 KB Output is partially correct
27 Partially correct 0 ms 212 KB Output is partially correct
28 Partially correct 0 ms 212 KB Output is partially correct
29 Partially correct 0 ms 212 KB Output is partially correct
30 Partially correct 1 ms 212 KB Output is partially correct
31 Partially correct 0 ms 212 KB Output is partially correct
32 Partially correct 1 ms 212 KB Output is partially correct
33 Partially correct 1 ms 212 KB Output is partially correct
34 Partially correct 0 ms 212 KB Output is partially correct
35 Partially correct 1 ms 212 KB Output is partially correct
36 Partially correct 0 ms 212 KB Output is partially correct
37 Partially correct 0 ms 212 KB Output is partially correct
38 Partially correct 0 ms 212 KB Output is partially correct
39 Partially correct 0 ms 212 KB Output is partially correct
40 Partially correct 0 ms 272 KB Output is partially correct