Submission #946140

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
946140	2024-03-14T10:49:40 Z	Nika533	Scales (IOI15_scales)	C++14	23.5895 / 100	1 ms	600 KB

scales

#pragma GCC diagnostic warning "-std=c++11"
#include <bits/stdc++.h>
#include "scales.h"
#define pb push_back
#define f first
#define s second
#define MOD 1000000007
#define flush fflush(stdout)
#define all(x) (x).begin(),(x).end()
#define allr(x) (x).rbegin(), (x).rend()
#define pii pair<int,int>
using namespace std;
int n,m,k;

void init(int T) {
}

int check(int a, int arr[]) {
	int sz=a-1;
	int x=getNextLightest(arr[sz-3],arr[sz-2],arr[sz-1],a);
	if (x==arr[sz-1]) {
		if (getHeaviest(arr[sz-2],arr[sz-1],a)==a) {
			x=getNextLightest(arr[0],arr[1],arr[2],a);
			if (x==arr[2]) {
				if (getHeaviest(arr[0],arr[1],a)==a) {
					x=-1;
				}
			}
		}
	}
	int indd=x;
	for (int i=0; i<sz; i++) if (arr[i]==x) indd=i;
	return indd;
}

void orderCoins() {
   int w[6];
	int a[3];
	int lb;
	a[2]=getLightest(1,2,3);
	a[1]=getMedian(1,2,3);
	a[0]=getHeaviest(1,2,3);
	int x=check(4,a);
	int b[4],ind=0;
	for (int i=0; i<3; i++) {
		if (x==i-1) {
			b[ind]=4;
			ind++;
		}
		b[ind]=a[i];
		ind++;
	}
	if (x==2) b[3]=4;
	int y=check(5,b);
	int c[5]; ind=0;
	for (int i=0; i<4; i++) {
		if (y==i-1) {
			c[ind]=5;
			ind++;
		}
		c[ind]=b[i];
		ind++;
	}
	if (y==3) c[4]=5;
	int z=check(6,c);
	ind=0;
	for (int i=0; i<5; i++) {
		if (z==i-1) {
			w[ind]=6;
			ind++;
		}
		w[ind]=c[i];
		ind++;
	}
	if (z==4) w[5]=6;
	reverse(w,w+6);
	answer(w);
}

Compilation message

scales.cpp:1:32: warning: '-std=c++11' is not an option that controls warnings [-Wpragmas]
    1 | #pragma GCC diagnostic warning "-std=c++11"
      |                                ^~~~~~~~~~~~
scales.cpp: In function 'void init(int)':
scales.cpp:15:15: warning: unused parameter 'T' [-Wunused-parameter]
   15 | void init(int T) {
      |           ~~~~^
scales.cpp: In function 'void orderCoins()':
scales.cpp:39:6: warning: unused variable 'lb' [-Wunused-variable]
   39 |  int lb;
      |      ^~

Subtask #1

23.589458 / 100.0

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