oj.uz

Submission #485440

# Submission time Handle Problem Language Result Execution time Memory
485440 2021-11-07T18:53:02 Z AmirElarbi Scales (IOI15_scales) C++14
0 / 100
 1 ms 204 KB 
#include <bits/stdc++.h>
#include "scales.h"
#define vi vector<int>
#define ve vector
#define ll long long
#define vf vector<float>
#define vll vector<pair<ll,ll>>
#define ii pair<int,int>
#define vvi vector<vi>
#define vii vector<ii>
#define gii greater<ii>
#define pb push_back
#define fi first
#define se second
#define INF 1e9
#define eps 1e-7
#define eps1 1e-25
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MAX_A 1e5+5
#define V 450
using namespace std;
const int MOD = 1e9+7;
const int nax = 200005;
int w[6],a[6];
void init(int T) {
    return;
}

void orderCoins() {
    int light = getLightest(1,2,3), hev = getHeaviest(1,2,3);
    light = getLightest(light,4,5), hev = getHeaviest(hev,4,5);
    if(light!=4)
        light = getLightest(light,4,6);
    else
        light = getLightest(light,5,6);
    if(hev!=4)
        hev = getHeaviest(hev,4,6);
    else
        hev = getHeaviest(hev,5,6);
    
    w[0] = light;
    a[light-1] = 1;
    vi s;
    for(int i = 0; i < 6; i++){
        if(!a[i]){s.pb(i+1);}
    }
    int res = getNextLightest(s[0],s[1],s[2],light);
    w[1] = light = getLightest(res,s[3],s[4]);
    a[light-1] = true;
    s.clear();
    for(int i = 0; i < 6; i++){
        if(!a[i]){s.pb(i+1);}
    }
    res = getNextLightest(s[0],s[1],s[2],light);
    w[2] = light = getMedian(res,s[3],w[1]);
    a[light-1] = true;
    s.clear();
    for(int i = 0; i < 6; i++){
        if(!a[i]){s.pb(i+1);}
    }
    w[3] = light = getNextLightest(s[0],s[1],s[2],light);
    a[light-1] = true;
    w[5] = hev;
    for(int i = 0; i < 6; i++){
        if(!a[i]){w[4] = i; break;}
    }
    answer(w);
}

Compilation message

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

Subtask #1
0.0 / 100.0

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