답안 #436574

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
436574	2021-06-24T16:05:12 Z	jeqcho	저울 (IOI15_scales)	C++17	45.4545 / 100	5 ms	204 KB

scales

#include "scales.h"
#include <bits/stdc++.h>
using namespace std;

typedef long double ld;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpi;

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define pb push_back
#define rsz resize
#define sz(x) int(x.size())
#define all(x) begin(x), end(x)
#define fi first
#define se second


void init(int T) {
    /* ... */
}

vi so(vi o)
{
	int h=getHeaviest(o[0],o[1],o[2]);
	int l=getLightest(o[0],o[1],o[2]);
	int m;
	F0R(i,3)if(o[i]!=h&&o[i]!=l)m=o[i];
	return {l,m,h};
}

void orderCoins() {
    vi s1 = so({1,2,3});
    vi s2 = so({4,5,6});
    vi ans;
    while(!s1.empty()&&!s2.empty())
    {
		int u1=s1.back();
		int u2=s2.back();
		int mn;
		if(u1==s1.front())mn=s2.front();
		else mn=s1.front();
		if(mn==u2)
		{
			int l=getLightest(u1,u2,ans.back());
			if(l==u1)
			{
				s2.pop_back();
				ans.pb(u2);
			}
			else
			{
				s1.pop_back();
				ans.pb(u1);
			}
		}
		else
		{
			int h=getHeaviest(u1,u2,mn);
			if(h!=u1)s2.pop_back();
			else s1.pop_back();
			ans.pb(h);
		}
	}
	reverse(all(s1));
	reverse(all(s2));
	ans.insert(ans.end(),all(s1));
	ans.insert(ans.end(),all(s2));
	reverse(all(ans));
	int W[6];
	F0R(i,6)W[i]=ans[i];
	answer(W);
}

Compilation message

scales.cpp: In function 'void init(int)':
scales.cpp:25:15: warning: unused parameter 'T' [-Wunused-parameter]
   25 | void init(int T) {
      |           ~~~~^
scales.cpp: In function 'vi so(vi)':
scales.cpp:35:15: warning: 'm' may be used uninitialized in this function [-Wmaybe-uninitialized]
   35 |  return {l,m,h};
      |               ^

Subtask #1

45.454545 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Partially correct	0 ms	204 KB	Output is partially correct
2	Partially correct	1 ms	204 KB	Output is partially correct
3	Partially correct	1 ms	204 KB	Output is partially correct
4	Partially correct	0 ms	204 KB	Output is partially correct
5	Partially correct	5 ms	204 KB	Output is partially correct
6	Partially correct	1 ms	204 KB	Output is partially correct
7	Partially correct	1 ms	204 KB	Output is partially correct
8	Partially correct	1 ms	204 KB	Output is partially correct
9	Partially correct	1 ms	204 KB	Output is partially correct
10	Partially correct	1 ms	204 KB	Output is partially correct
11	Partially correct	1 ms	204 KB	Output is partially correct
12	Partially correct	1 ms	204 KB	Output is partially correct
13	Partially correct	1 ms	204 KB	Output is partially correct
14	Partially correct	1 ms	204 KB	Output is partially correct
15	Partially correct	1 ms	204 KB	Output is partially correct
16	Partially correct	1 ms	204 KB	Output is partially correct
17	Partially correct	1 ms	204 KB	Output is partially correct
18	Partially correct	1 ms	204 KB	Output is partially correct
19	Partially correct	1 ms	204 KB	Output is partially correct
20	Partially correct	1 ms	204 KB	Output is partially correct
21	Partially correct	1 ms	204 KB	Output is partially correct
22	Partially correct	1 ms	204 KB	Output is partially correct
23	Partially correct	1 ms	204 KB	Output is partially correct
24	Partially correct	1 ms	204 KB	Output is partially correct
25	Partially correct	1 ms	204 KB	Output is partially correct
26	Partially correct	1 ms	204 KB	Output is partially correct
27	Partially correct	1 ms	204 KB	Output is partially correct
28	Partially correct	1 ms	204 KB	Output is partially correct
29	Partially correct	1 ms	204 KB	Output is partially correct
30	Partially correct	0 ms	204 KB	Output is partially correct
31	Partially correct	1 ms	204 KB	Output is partially correct
32	Partially correct	1 ms	204 KB	Output is partially correct
33	Partially correct	1 ms	204 KB	Output is partially correct
34	Partially correct	1 ms	204 KB	Output is partially correct
35	Partially correct	1 ms	204 KB	Output is partially correct
36	Partially correct	1 ms	204 KB	Output is partially correct
37	Partially correct	1 ms	204 KB	Output is partially correct
38	Partially correct	1 ms	204 KB	Output is partially correct
39	Partially correct	1 ms	204 KB	Output is partially correct
40	Partially correct	1 ms	204 KB	Output is partially correct