oj.uz

Submission #831696

# Submission time Handle Problem Language Result Execution time Memory
831696 2023-08-20T12:24:35 Z qin Scales (IOI15_scales) C++14
0 / 100
 1000 ms 256 KB 
#include <bits/stdc++.h>
#include "scales.h"
using namespace std;
void orderCoins(){
		vector<int> v1, v2;
		int t1 = getLightest(1, 2, 3), t2 = getMedian(1, 2, 3), t3 = getHeaviest(1, 2, 3);
		v1 = {t3, t2, t1};
		t1 = getLightest(4, 5, 6), t2 = getMedian(4, 5, 6), t3 = getHeaviest(4, 5, 6);
		v2 = {t3, t2, t1};
		vector<int> wynik;
		while(!v1.empty() || !v2.empty()){
				if(v1.size() == (size_t) 1 && v2.size() == (size_t) 1){
						int tmp = getMedian(wynik[0], v1.back(), v2.back());
						if(v1.back() == tmp) wynik.emplace_back(v1.back()), wynik.emplace_back(v2.back());
						else wynik.emplace_back(v2.back()), wynik.emplace_back(v1.back());
						v1.pop_back(), v2.pop_back();
						continue;
				}
				if(v1.empty()) while(!v1.empty())  wynik.emplace_back(v1.back()), v1.pop_back();
				if(v2.empty()) while(!v2.empty())  wynik.emplace_back(v2.back()), v2.pop_back();
				if(v1.size() && v2.size()){
						if(v2.size() > v1.size()) swap(v1, v2);
						int tmp = getLightest(v1.back(), v2.back(), v1[0]);
						if(v1.back() == tmp) wynik.emplace_back(v1.back()), v1.pop_back();
						else wynik.emplace_back(v2.back()), v2.pop_back();
				}
		}
		int w[6];
		for(int i = 0; i < 6; ++i) w[i] = wynik[i];
		answer(w);
}
void init(int T){
		
}

Compilation message

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

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1068 ms 212 KB Time limit exceeded
2 Execution timed out 1031 ms 212 KB Time limit exceeded
3 Execution timed out 1064 ms 212 KB Time limit exceeded
4 Execution timed out 1077 ms 256 KB Time limit exceeded
5 Execution timed out 1086 ms 212 KB Time limit exceeded
6 Execution timed out 1080 ms 212 KB Time limit exceeded
7 Execution timed out 1072 ms 212 KB Time limit exceeded
8 Execution timed out 1042 ms 212 KB Time limit exceeded
9 Execution timed out 1074 ms 212 KB Time limit exceeded
10 Execution timed out 1074 ms 212 KB Time limit exceeded
11 Execution timed out 1084 ms 212 KB Time limit exceeded
12 Execution timed out 1080 ms 212 KB Time limit exceeded
13 Execution timed out 1073 ms 212 KB Time limit exceeded
14 Execution timed out 1071 ms 212 KB Time limit exceeded
15 Execution timed out 1084 ms 212 KB Time limit exceeded
16 Execution timed out 1086 ms 212 KB Time limit exceeded
17 Execution timed out 1082 ms 212 KB Time limit exceeded
18 Execution timed out 1078 ms 212 KB Time limit exceeded
19 Execution timed out 1079 ms 212 KB Time limit exceeded
20 Execution timed out 1079 ms 212 KB Time limit exceeded
21 Execution timed out 1084 ms 212 KB Time limit exceeded
22 Execution timed out 1079 ms 212 KB Time limit exceeded
23 Execution timed out 1076 ms 212 KB Time limit exceeded
24 Execution timed out 1070 ms 212 KB Time limit exceeded
25 Execution timed out 1070 ms 212 KB Time limit exceeded
26 Execution timed out 1084 ms 212 KB Time limit exceeded
27 Execution timed out 1086 ms 212 KB Time limit exceeded
28 Execution timed out 1078 ms 212 KB Time limit exceeded
29 Execution timed out 1075 ms 212 KB Time limit exceeded
30 Execution timed out 1081 ms 212 KB Time limit exceeded
31 Execution timed out 1074 ms 212 KB Time limit exceeded
32 Execution timed out 1063 ms 212 KB Time limit exceeded
33 Execution timed out 1063 ms 212 KB Time limit exceeded
34 Execution timed out 1064 ms 212 KB Time limit exceeded
35 Execution timed out 1077 ms 216 KB Time limit exceeded
36 Execution timed out 1079 ms 212 KB Time limit exceeded
37 Execution timed out 1074 ms 212 KB Time limit exceeded
38 Execution timed out 1073 ms 212 KB Time limit exceeded
39 Execution timed out 1071 ms 212 KB Time limit exceeded
40 Execution timed out 1077 ms 212 KB Time limit exceeded