oj.uz

Submission #125595

# Submission time Handle Problem Language Result Execution time Memory
125595 2019-07-06T03:50:23 Z baluteshih Scales (IOI15_scales) C++14
71.4286 / 100
 3 ms 384 KB 
#include "scales.h"
#include <bits/stdc++.h>
#define pb push_back
#define MP make_pair
#define F first
#define S second
#define MEM(i,j) memset(i,j,sizeof i)
#define ALL(v) v.begin(),v.end()
#define ET cout << "\n"
#define DB(a,s,e) {for(int i=s;i<e;++i) cout << a[i] << " ";ET;}
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

vector<int> G[6];

void init(int T)
{
    
}

bool check(int W[])
{
	int in[6],tp=0;
	queue<int> q;
	for(int i=0;i<6;++i)
		for(int j:G[i])
			++in[j];
	for(int i=0;i<6;++i)
		if(!in[i]) q.push(i);
	while(!q.empty())
	{
		if(q.size()!=1) return 0;
		int tmp=q.front();
		q.pop();
		W[tp++]=tmp+1;
		for(int i:G[tmp])
			if(!--in[i])
				q.push(i);
	}
	return 1;
}

void orderCoins()
{
	int W[6]={1,2,3,4,5,6};
    int x=getLightest(1,2,3),t;
    swap(W[0],W[x-1]);
    x=getMedian(W[0],W[1],4),W[3]=W[2];
    if(x==W[0]) W[2]=W[1],W[1]=W[0],W[0]=4;
    else if(x==W[1]) W[2]=4;
    else W[2]=W[1],W[1]=4;
    x=getNextLightest(W[0],W[1],W[2],W[3]);
    if(x==W[1])
    	t=W[3],W[3]=W[2],W[2]=W[1],W[1]=t;
    else if(x==W[2])
    	t=W[3],W[3]=W[2],W[2]=t;
    //W 1~4 is ok
    x=getLightest(W[2],5,6);
    if(x==W[2])
    { 
    	x=getHeaviest(5,6,W[3]);
    	if(x==5) swap(W[5],W[4]);
    	else if(x==W[3]) swap(W[3],W[5]);
    	x=getHeaviest(W[2],W[3],W[4]);
    	if(x==W[3]) swap(W[3],W[4]);
	}
	else
	{
		if(x==W[5]) swap(W[4],W[5]);
		x=getNextLightest(W[0],W[1],W[2],W[4]);
		if(x==W[0])
		{
			t=W[4],W[4]=W[3],W[3]=W[2],W[2]=W[1],W[1]=W[0],W[0]=t;
			x=getNextLightest(W[0],W[1],W[2],W[5]);
			if(x==W[1])
				t=W[5],W[5]=W[4],W[4]=W[3],W[3]=W[2],W[2]=W[1],W[1]=t;
			else if(x==W[2])
				t=W[5],W[5]=W[4],W[4]=W[3],W[3]=W[2],W[2]=t;
			else
			{
				t=W[5],W[5]=W[4],W[4]=W[3],W[3]=t;
				x=getNextLightest(W[2],W[4],W[5],W[3]);
				if(x==W[2])
					t=W[3],W[3]=W[4],W[4]=W[5],W[5]=t;
				else if(x==W[5])
					swap(W[3],W[4]);
			}
		}
		else if(x==W[1])
		{
			t=W[4],W[4]=W[3],W[3]=W[2],W[2]=W[1],W[1]=t;
			x=getNextLightest(W[1],W[2],W[3],W[5]);
			if(x==W[2])
				t=W[5],W[5]=W[4],W[4]=W[3],W[3]=W[2],W[2]=t;
			else if(x==W[3])
				t=W[5],W[5]=W[4],W[4]=W[3],W[3]=t;
			else if(getHeaviest(W[0],W[5],W[4])==W[4])
				swap(W[4],W[5]);
		}
		else
		{
			t=W[4],W[4]=W[3],W[3]=W[2],W[2]=t;
			x=getNextLightest(W[2],W[3],W[4],W[5]);
			if(x==W[3])
				t=W[5],W[5]=W[4],W[4]=W[3],W[3]=t;
			else if(x==W[4])
				swap(W[4],W[5]);
		}
	}
    return answer(W);
}

Compilation message

scales.cpp: In function 'void init(int)':
scales.cpp:18:15: warning: unused parameter 'T' [-Wunused-parameter]
 void init(int T)
               ^

Subtask #1
71.428571 / 100.0

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