oj.uz

Submission #800598

# Submission time Handle Problem Language Result Execution time Memory
800598 2023-08-01T16:35:32 Z firewater Scales (IOI15_scales) C++14
45.4545 / 100
 1 ms 212 KB 
#include "scales.h"
#include <assert.h>
#include <stdio.h>
#include <stdlib.h>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define ll long long
using namespace std;























// int getHeaviest(int A, int B, int C) 
// int getMedian(int A, int B, int C) 
// int getLightest(int A, int B, int C) 
// int getNextLightest(int A, int B, int C, int D) 
#define N 100
int w,a[N],b[N],v[N],p[N],ans[6];
void init(int T) {
    /* ... */
}
void orderCoins() {
    /* ... */
    a[1]=getLightest(1,2,3);
    a[2]=getMedian(1,2,3);
    a[3]=6-a[1]-a[2];
    a[4]=getLightest(4,5,6);
    a[5]=getMedian(4,5,6);
    a[6]=15-a[4]-a[5];
    for(int i=1;i<=6;++i)
        v[a[i]]=i;

    if(getLightest(a[1],a[2],a[4])==a[4]){
        ans[0]=a[4];
        ans[1]=getLightest(a[1],a[5],a[6]);
    }
    else{
        ans[0]=a[1];
        ans[1]=getLightest(a[2],a[3],a[4]);
    }
    if(getHeaviest(a[3],a[5],a[6])==a[3]){
        ans[5]=a[3];
        ans[4]=getHeaviest(a[1],a[2],a[6]);
    }
    else{
        ans[5]=a[6];
        ans[4]=getHeaviest(a[3],a[4],a[5]);
    }
    for(int i=1;i<=6;++i)
        p[i]=0;
    p[ans[0]]=p[ans[1]]=p[ans[4]]=p[ans[5]]=1;
    w=0;
    for(int i=1;i<=6;++i)
        if(!p[i])
            b[++w]=i;
    if((b[1]<=3)==(b[2]<=3)){
        if(v[b[1]]<v[b[2]])ans[2]=b[1],ans[3]=b[2];
        else ans[2]=b[2],ans[3]=b[1];
    }
    else{
        ans[2]=getLightest(b[1],b[2],ans[5]);
        ans[3]=b[1]+b[2]-ans[2];
    }
    answer(ans);
}

Compilation message

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

Subtask #1
45.454545 / 100.0

# Verdict Execution time Memory 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 0 ms 212 KB Output is partially correct
4 Partially correct 0 ms 212 KB Output is partially correct
5 Partially correct 1 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 0 ms 212 KB Output is partially correct
9 Partially correct 1 ms 212 KB Output is partially correct
10 Partially correct 0 ms 212 KB Output is partially correct
11 Partially correct 0 ms 212 KB Output is partially correct
12 Partially correct 0 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 0 ms 212 KB Output is partially correct
20 Partially correct 0 ms 212 KB Output is partially correct
21 Partially correct 0 ms 212 KB Output is partially correct
22 Partially correct 0 ms 212 KB Output is partially correct
23 Partially correct 0 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 0 ms 212 KB Output is partially correct
31 Partially correct 0 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 0 ms 212 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 0 ms 212 KB Output is partially correct