# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
936673 | 2024-03-02T13:45:49 Z | PagodePaiva | Scales (IOI15_scales) | C++17 | 1 ms | 440 KB |
#include<bits/stdc++.h> #include "scales.h" using namespace std; void init(int T) { /* ... */ } void triple(vector <int> &v){ int a = getHeaviest(v[0], v[1], v[2]); int b = getMedian(v[0], v[1], v[2]); int c; for(auto x : v){ if(x == a) continue; if(x == b) continue; c = x; break; } v = {a, b, c}; return; } void orderCoins() { vector <int> v1 = {1, 2, 3}; vector <int> v2 = {4, 5, 6}; triple(v1); triple(v2); int x = getLightest(v1[2], v2[2], v1[1]); vector <int> res; if(x == v1[2]){ res.push_back(x); v1.pop_back(); } else{ res.push_back(x); v2.pop_back(); } while(!v1.empty() and !v2.empty()){ x = getMedian(res.back(), v1.back(), v2.back()); if(x == v1.back()) v1.pop_back(); else v2.pop_back(); res.push_back(x); } while(!v1.empty()){ res.push_back(v1.back()); v1.pop_back(); } while(!v2.empty()){ res.push_back(v2.back()); v2.pop_back(); } int w[6]; int i = 5; for(auto x : res){ w[i] = x; i--; } answer(w); return; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Output isn't correct |
2 | Incorrect | 1 ms | 348 KB | Output isn't correct |
3 | Incorrect | 0 ms | 348 KB | Output isn't correct |
4 | Incorrect | 1 ms | 344 KB | Output isn't correct |
5 | Incorrect | 0 ms | 348 KB | Output isn't correct |
6 | Incorrect | 0 ms | 348 KB | Output isn't correct |
7 | Incorrect | 1 ms | 348 KB | Output isn't correct |
8 | Incorrect | 1 ms | 348 KB | Output isn't correct |
9 | Incorrect | 0 ms | 348 KB | Output isn't correct |
10 | Incorrect | 0 ms | 348 KB | Output isn't correct |
11 | Incorrect | 0 ms | 440 KB | Output isn't correct |
12 | Incorrect | 0 ms | 348 KB | Output isn't correct |
13 | Incorrect | 0 ms | 348 KB | Output isn't correct |
14 | Incorrect | 1 ms | 348 KB | Output isn't correct |
15 | Incorrect | 1 ms | 348 KB | Output isn't correct |
16 | Incorrect | 1 ms | 348 KB | Output isn't correct |
17 | Incorrect | 0 ms | 348 KB | Output isn't correct |
18 | Incorrect | 1 ms | 348 KB | Output isn't correct |
19 | Incorrect | 0 ms | 348 KB | Output isn't correct |
20 | Incorrect | 0 ms | 348 KB | Output isn't correct |
21 | Incorrect | 1 ms | 348 KB | Output isn't correct |
22 | Incorrect | 0 ms | 348 KB | Output isn't correct |
23 | Incorrect | 0 ms | 348 KB | Output isn't correct |
24 | Incorrect | 1 ms | 348 KB | Output isn't correct |
25 | Incorrect | 1 ms | 348 KB | Output isn't correct |
26 | Incorrect | 1 ms | 348 KB | Output isn't correct |
27 | Incorrect | 0 ms | 436 KB | Output isn't correct |
28 | Incorrect | 0 ms | 348 KB | Output isn't correct |
29 | Incorrect | 0 ms | 348 KB | Output isn't correct |
30 | Incorrect | 0 ms | 348 KB | Output isn't correct |
31 | Incorrect | 0 ms | 348 KB | Output isn't correct |
32 | Incorrect | 0 ms | 348 KB | Output isn't correct |
33 | Incorrect | 1 ms | 348 KB | Output isn't correct |
34 | Incorrect | 0 ms | 344 KB | Output isn't correct |
35 | Incorrect | 0 ms | 348 KB | Output isn't correct |
36 | Incorrect | 0 ms | 348 KB | Output isn't correct |
37 | Incorrect | 0 ms | 348 KB | Output isn't correct |
38 | Incorrect | 0 ms | 348 KB | Output isn't correct |
39 | Incorrect | 0 ms | 348 KB | Output isn't correct |
40 | Incorrect | 1 ms | 348 KB | Output isn't correct |