oj.uz

Submission #802704

# Submission time Handle Problem Language Result Execution time Memory
802704 2023-08-02T13:30:49 Z Liudas Scales (IOI15_scales) C++17
71.4286 / 100
 1 ms 304 KB 
#include <bits/stdc++.h>
#include "scales.h"
using namespace std;
void orderCoins(){
    int arr[6];
    vector<int> b = {1,2,3,4,5,6};
    int ans = getHeaviest(1,2,3);
    int ans2 = getHeaviest(4, 5, 6);
    int ans3 = getHeaviest(ans, ans2, (ans == 3? 2: 3));
    arr[5] = ans3;
    b.erase(find(b.begin(), b.end(), ans3));
    if(ans == ans3){
        b.erase(find(b.begin(), b.end(), ans2));
        ans3 = getHeaviest(b[0], b[1], ans2);
        b.push_back(ans2);
    }
    else{
        b.erase(find(b.begin(), b.end(), ans));
        ans3 = getHeaviest(b[2], b[3], ans);
        b.push_back(ans);
    }
    b.erase(find(b.begin(), b.end(), ans3));
    arr[4] = ans3;
    int c1 = b[0], c2 = b[1], c3 = b[2], c4;
    ans = getLightest(b[0],b[1],b[2]);
    b.erase(find(b.begin(), b.end(), ans));
    ans2 = getHeaviest(b[0], b[1], b[2]);
    b.push_back(ans);
    b.erase(find(b.begin(), b.end(), ans2));
    arr[3] = ans2;
    ans3 = getMedian(b[0], b[1], b[2]);
    if(ans == c1){
        b.erase(find(b.begin(), b.end(), c1));
        if(ans2 == c2){
        b.erase(find(b.begin(), b.end(), c3));
        c4 = c3;
        }
        else{
        b.erase(find(b.begin(), b.end(), c2));
        c4 = c2;
        }
        if(ans3 == ans){
            arr[0] = b[0];
            arr[1] = ans;
            arr[2] = c4;
        }
        else if(ans3 == c4){
            arr[0] = ans;
            arr[1] = c4;
            arr[2] = b[0];
        }
        else{
            arr[0] = ans;
            arr[1] = b[0];
            arr[2] = c4;
        }

    }
    if(ans == c2){
        b.erase(find(b.begin(), b.end(), c2));
        if(ans2 == c1){
        b.erase(find(b.begin(), b.end(), c3));
        c4 = c3;
        }
        else{
        b.erase(find(b.begin(), b.end(), c1));
        c4 = c1;
        }
        if(ans3 == ans){
            arr[0] = b[0];
            arr[1] = ans;
            arr[2] = c4;
        }
        else if(ans3 == c4){
            arr[0] = ans;
            arr[1] = c4;
            arr[2] = b[0];
        }
        else{
            arr[0] = ans;
            arr[1] = b[0];
            arr[2] = c4;
        }
    }
    if(ans == c3){
        b.erase(find(b.begin(), b.end(), c3));
        if(ans2 == c2){
        b.erase(find(b.begin(), b.end(), c1));
        c4 = c1;
        }
        else{
        b.erase(find(b.begin(), b.end(), c2));
        c4 = c2;
        }
        if(ans3 == ans){
            arr[0] = b[0];
            arr[1] = ans;
            arr[2] = c4;
        }
        else if(ans3 == c4){
            arr[0] = ans;
            arr[1] = c4;
            arr[2] = b[0];
        }
        else{
            arr[0] = ans;
            arr[1] = b[0];
            arr[2] = c4;
        }
    }
    answer(arr);
}
void init(int T){
}

Compilation message

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

Subtask #1
71.428571 / 100.0

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