oj.uz

Submission #968723

# Submission time Handle Problem Language Result Execution time Memory
968723 2024-04-23T23:58:37 Z APROHACK Scales (IOI15_scales) C++17
45.4545 / 100
 1 ms 436 KB 
#include <bits/stdc++.h>
#include "scales.h"
using namespace std;



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

vector<int> obtener_monedas(set<int>&num){
  vector<int>ans;
  for(auto i : num){
    // i va tomar el valor de cada elemento en el set
    ans.push_back(i);
  }
  return ans;
}

void orderCoins() {
    /* ... */
    int w[6];
    set<int> num = {1,2,3,4,5,6};
    int a = getLightest(1,2,3);
    int b = getLightest(4,5,6);
    int c;
    for (int i = 0; i < 3; i++){
      if (a != i+1){
        c = i+1;
        break;
      }
    }
    w[0] = getLightest(a,b,c);
    num.erase(w[0]);
    vector<int> numeros = obtener_monedas(num);
    a = getLightest(numeros[0], numeros[1], numeros[2]);
    w[1] = getLightest(a, numeros[3], numeros[4]);
    num.erase(w[1]);
    numeros = obtener_monedas(num);
    a = getLightest(numeros[0], numeros[1], numeros[2]);
    w[2] = getMedian (w[1], a, numeros[3]);
    num.erase(w[2]);
    numeros = obtener_monedas(num);
    w[3] = getLightest(numeros[0], numeros[1], numeros[2]);
    w[4] = getMedian(numeros[0], numeros[1], numeros[2]);
    num.erase(w[3]);
    num.erase(w[4]);
    numeros = obtener_monedas(num);
    w[5] = numeros[0];


    answer(w);
}

Compilation message

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

Subtask #1
45.454545 / 100.0

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