oj.uz

Submission #520095

# Submission time Handle Problem Language Result Execution time Memory
520095 2022-01-28T10:40:41 Z pisikaka Scales (IOI15_scales) C++17
20 / 100
 1 ms 204 KB 
#include "scales.h"
#include <bits/stdc++.h>
using namespace std;
 
void init(int T) {
	return;
}
 
void orderCoins() {
    int w[] = {1, 2, 3, 4, 5, 6};
 	vector<int> lst = {0, 2, 3, 2, 1, 0, 2, 3};
        for(int i : lst){
          int v = getLightest(w[i], w[i+1], w[i+2]);
          for(int j = i; j <= i+2; ++j) if(v == w[j]) swap(w[i], w[j]);
          v = getMedian(w[i], w[i+1], w[i+2]);
          for(int j = i; j <= i+2; ++j) if(v == w[j]) swap(w[i+1], w[j]);
        }
	answer(w);
  	return;
}

Compilation message

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

Subtask #1
20.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 204 KB Output is partially correct
2 Partially correct 0 ms 204 KB Output is partially correct
3 Partially correct 0 ms 204 KB Output is partially correct
4 Partially correct 1 ms 204 KB Output is partially correct
5 Partially correct 1 ms 204 KB Output is partially correct
6 Partially correct 0 ms 204 KB Output is partially correct
7 Partially correct 0 ms 204 KB Output is partially correct
8 Partially correct 0 ms 204 KB Output is partially correct
9 Partially correct 0 ms 204 KB Output is partially correct
10 Partially correct 0 ms 204 KB Output is partially correct
11 Partially correct 0 ms 204 KB Output is partially correct
12 Partially correct 0 ms 204 KB Output is partially correct
13 Partially correct 0 ms 204 KB Output is partially correct
14 Partially correct 1 ms 204 KB Output is partially correct
15 Partially correct 0 ms 204 KB Output is partially correct
16 Partially correct 0 ms 204 KB Output is partially correct
17 Partially correct 0 ms 204 KB Output is partially correct
18 Partially correct 0 ms 204 KB Output is partially correct
19 Partially correct 0 ms 204 KB Output is partially correct
20 Partially correct 0 ms 204 KB Output is partially correct
21 Partially correct 0 ms 204 KB Output is partially correct
22 Partially correct 1 ms 204 KB Output is partially correct
23 Partially correct 0 ms 204 KB Output is partially correct
24 Partially correct 0 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 0 ms 204 KB Output is partially correct
29 Partially correct 0 ms 204 KB Output is partially correct
30 Partially correct 0 ms 204 KB Output is partially correct
31 Partially correct 0 ms 204 KB Output is partially correct
32 Partially correct 0 ms 204 KB Output is partially correct
33 Partially correct 0 ms 204 KB Output is partially correct
34 Partially correct 1 ms 204 KB Output is partially correct
35 Partially correct 0 ms 204 KB Output is partially correct
36 Partially correct 0 ms 204 KB Output is partially correct
37 Partially correct 1 ms 204 KB Output is partially correct
38 Partially correct 0 ms 204 KB Output is partially correct
39 Partially correct 0 ms 204 KB Output is partially correct
40 Partially correct 0 ms 204 KB Output is partially correct