oj.uz

Submission #284108

# Submission time Handle Problem Language Result Execution time Memory
284108 2020-08-26T20:28:28 Z diegoangulo5 Scales (IOI15_scales) C++14
55.5556 / 100
 1 ms 384 KB 
#include "scales.h"
#include <bits/stdc++.h>

using namespace std;

vector<int>n;

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

int excluir(int a, int b, int x, int y, int z){
    if(a!=x && b!=x)return x;
    if(a!=y && b!=y)return y;
    return z;
}

int excluir(int a, int x, int y, int z){
    if(a!=x)return x;
    return y;
}

void quitar(int a){
    vector<int>::iterator it = n.begin();
    for(;it!=n.end();it++){
        if(*it == a){
            n.erase(it);
            return;
        }
    }
}

void orderCoins() {
    n.clear();
    for(int a=0;a<6;a++)n.push_back(a+1);
    int w[6] = {0,0,0,0,0,0};
    int a = getLightest(1,2,3);
    int b = getLightest(4,5,6);
    int c;
    w[0] = getLightest(a,b, excluir(a, 1, 2, 3));
    quitar(w[0]);
    if(w[0] == a){
        c = excluir(a, 1, 2, 3);
        w[1] = getLightest(b, c, excluir(a, c, 1, 2, 3));
    }
    if(w[0] == b){
        c = excluir(b, 4, 5, 6);
        w[1] = getLightest(a, c, excluir(b, c, 4, 5, 6));
    }
    quitar(w[1]);
    a = getLightest(n[0], n[1], n[2]);
    w[2] = getLightest(a, n[3], excluir(a, n[3], n[0], n[1], n[2]));
    quitar(w[2]);
    w[3] = getLightest(n[0], n[1], n[2]);
    w[4] = getMedian(n[0], n[1], n[2]);
    quitar(w[3]);
    quitar(w[4]);
    w[5] = n[0];
    answer(w);
}

Compilation message

scales.cpp: In function 'void init(int)':
scales.cpp:8:15: warning: unused parameter 'T' [-Wunused-parameter]
    8 | void init(int T) {
      |           ~~~~^
scales.cpp: In function 'int excluir(int, int, int, int)':
scales.cpp:18:38: warning: unused parameter 'z' [-Wunused-parameter]
   18 | int excluir(int a, int x, int y, int z){
      |                                  ~~~~^

Subtask #1
55.555556 / 100.0

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