oj.uz

답안 #685169

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
685169 2023-01-23T16:08:23 Z APROHACK 저울 (IOI15_scales) C++14
46.0227 / 100
 1 ms 224 KB 
#include "scales.h"
#include <bits/stdc++.h>
#define pb push_back
#define ll long long
using namespace std;

set<int>restantes;
vector<int>r;
int respuestas[4][6][6][6][6];



int mayor(int a, int b, int c){
    //cout << "llegó " << a << " " << b << "  " << c << endl;
    if(respuestas[0][a][b][c][0] != -1 )return respuestas[0][a][b][c][0];
    else return respuestas[0][a][b][c][0] = getHeaviest(a, b, c);
}
void init(int T) {
    
}

void reiniciar(){
    for(int i = 1 ; i <= 6 ; i ++)restantes.insert(i);
    memset(respuestas, -1 , sizeof respuestas);
}
void getRestantesEnORden(){
    r.clear();
    //cout << "reiniciando " << endl;
    for(auto i : restantes){
        r.pb(i);
        //cout << i << " " ;
    }
    //cout << endl;
}

void orderCoins() {
    /* ... */
    reiniciar();
    int W[] = {1, 2, 3, 4, 5, 6};
    getRestantesEnORden();
    int a = mayor(r[0], r[1], r[2]);
    int b = mayor(r[3], r[4], r[5]);
    W[5] = mayor(a, b, (r[0] == a ? r[1] : r[0]));

    restantes.erase(W[5]);
    getRestantesEnORden();
    a = mayor(r[0], r[1], r[2]);
    W[4] = mayor(a, r[3], r[4]);

    restantes.erase(W[4]);
    getRestantesEnORden();
    a = mayor(r[0], r[1], r[2]);
    W[3] = mayor(a, r[3], (r[0] == a ? r[1] : r[0]));

    restantes.erase(W[3]);
    getRestantesEnORden();
    W[2] = mayor(r[0], r[1], r[2]);
    W[1] = getMedian(r[0], r[1], r[2]);
    restantes.erase(W[2]);
    restantes.erase(W[1]);
    getRestantesEnORden();
    W[0] = r[0];

    answer(W);
}

Compilation message

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

Subtask #1
46.022727 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 212 KB Output is partially correct
2 Partially correct 0 ms 212 KB Output is partially correct
3 Partially correct 1 ms 212 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 212 KB Output is partially correct
7 Partially correct 1 ms 212 KB Output is partially correct
8 Partially correct 1 ms 212 KB Output is partially correct
9 Partially correct 1 ms 212 KB Output is partially correct
10 Partially correct 1 ms 212 KB Output is partially correct
11 Partially correct 0 ms 212 KB Output is partially correct
12 Partially correct 0 ms 224 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 212 KB Output is partially correct
20 Partially correct 0 ms 212 KB Output is partially correct
21 Partially correct 1 ms 212 KB Output is partially correct
22 Partially correct 0 ms 212 KB Output is partially correct
23 Partially correct 1 ms 212 KB Output is partially correct
24 Partially correct 0 ms 212 KB Output is partially correct
25 Partially correct 0 ms 212 KB Output is partially correct
26 Partially correct 0 ms 212 KB Output is partially correct
27 Partially correct 0 ms 212 KB Output is partially correct
28 Partially correct 0 ms 212 KB Output is partially correct
29 Partially correct 0 ms 212 KB Output is partially correct
30 Partially correct 1 ms 212 KB Output is partially correct
31 Partially correct 1 ms 212 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 0 ms 212 KB Output is partially correct
35 Partially correct 0 ms 212 KB Output is partially correct
36 Partially correct 1 ms 216 KB Output is partially correct
37 Partially correct 0 ms 212 KB Output is partially correct
38 Partially correct 0 ms 212 KB Output is partially correct
39 Partially correct 0 ms 212 KB Output is partially correct
40 Partially correct 1 ms 212 KB Output is partially correct