oj.uz

Submission #358013

# Submission time Handle Problem Language Result Execution time Memory
358013 2021-01-25T04:53:51 Z beksultan04 Scales (IOI15_scales) C++14
55.5556 / 100
 1 ms 492 KB 
#include "scales.h"
#ifndef EVAL
#include "grader.cpp"
#endif
#include <bits/stdc++.h>
using namespace std;
#define lol long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scanl(a) scanf("%lld",&a);
#define scanll(a,b) scanf("%lld %lld",&a, &b);
#define scanlll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define scan1(a) scanf("%d",&a);
#define scan2(a,b) scanf("%d %d",&a, &b);
#define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
#define eps 1e-12
void init(int T) {
    ret ;
    /* ... */
}
int vis[40];
void orderCoins() {
    /* ... */
    int i;
    vector <int> v(6);
    {
        int a = getLightest(1,2,3);
        int b = getLightest(4,5,6);
        int c;
        if (a == 1)
            c = getLightest(a,2,b);
        else
            c = getLightest(a,1,b);
        vis[c]=1;
        if (c == a){
            v[1] = b;
        }
        else v[1] = a;
        v[0] = c;
    }
    {
        int a=1,b,c,d,e;
        while (vis[a])a++;
        b = a+1;
        while (vis[b])b++;
        c = b+1;
        while (vis[c])c++;
        d = c+1;
        while (vis[d])d++;
        e = d+1;
        while (vis[e])e++;
        int r;
        if (c > 3)
            r = getLightest(a,b,v[1]);
        else
            r = getLightest(e,d,v[1]);
        v[1] = r;
        vis[r] = 1;
    }

    {
        int a=1,b,c,d;
        while (vis[a])a++;
        b = a+1;
        while (vis[b])b++;
        c = b+1;
        while (vis[c])c++;
        d = c+1;
        while (vis[d])d++;
        int r = getNextLightest(a,b,c,v[0]);
        if (r == a)
            r = getNextLightest(r,d,b,v[0]);
        else
            r = getNextLightest(r,d,a,v[0]);
        v[2] = r;
        vis[r] = 1;

    }

    {
        int a=1,b,c;
        while (vis[a])a++;
        b = a+1;
        while (vis[b])b++;
        c = b+1;
        while (vis[c])c++;
        int r = getNextLightest(a,b,c,v[0]);
        v[3] = r;
        vis[r] = 1;
    }
    {
        int a=1,b;
        while (vis[a])a++;
        b = a+1;
        while (vis[b])b++;
        int r = getHeaviest(a,b,v[0]);
        if (r == a){
            v[5] = a;
            v[4] = b;
        }
        else {
            v[4] = a;
            v[5] = b;
        }
    }
    int W[6];
    for (i=0;i<6;++i){
        vis[i+1]=0;;
        W[i] = v[i];
    }


    answer(W);
}

Compilation message

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

Subtask #1
55.555556 / 100.0

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