Submission #715809

# Submission time Handle Problem Language Result Execution time Memory
715809 2023-03-28T03:27:49 Z adamjinwei Scales (IOI15_scales) C++14
45.4545 / 100
1 ms 340 KB
#include <bits/stdc++.h>
#include "scales.h"
#define inf 1000000007
#define mod 1000000007
// #define int long long
// #pragma GCC optimize("Ofast","inline","-ffast-math")
// #pragma GCC target("avx,sse2,sse3,sse4,mmx")
using namespace std;
template <typename T> void read(T &x){
    x=0;char ch=getchar();int fh=1;
    while (ch<'0'||ch>'9'){if (ch=='-')fh=-1;ch=getchar();}
    while (ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
    x*=fh;
}
template <typename T> void write(T x) {
    if (x<0) x=-x,putchar('-');
    if (x>9) write(x/10);
    putchar(x%10+'0');
}
template <typename T> void writeln(T x) {
    write(x);
    puts("");
}
void init(int tc)
{
}
void orderCoins()
{
    vector<int> cur,ans;
    for(int i=1;i<=6;++i)
        cur.push_back(i);
    int mn=getLightest(getLightest(cur[0],cur[1],cur[2]),cur[3],cur[4]);
    mn=getLightest(mn,cur[5],(cur[0]==mn?cur[1]:cur[0]));
    ans.push_back(mn);cur.erase(find(cur.begin(),cur.end(),mn));
    mn=getLightest(getLightest(cur[0],cur[1],cur[2]),cur[3],cur[4]);
    ans.push_back(mn);cur.erase(find(cur.begin(),cur.end(),mn));
    mn=getLightest(cur[0],cur[1],cur[2]);
    mn=getLightest(mn,cur[3],(cur[0]==mn?cur[1]:cur[0]));
    ans.push_back(mn);cur.erase(find(cur.begin(),cur.end(),mn));
    mn=getLightest(cur[0],cur[1],cur[2]);
    ans.push_back(mn);
    int mid=getMedian(cur[0],cur[1],cur[2]);
    ans.push_back(mid);
    cur.erase(find(cur.begin(),cur.end(),mn));
    cur.erase(find(cur.begin(),cur.end(),mid));
    ans.push_back(cur[0]);
    int W[6];
    for(int i=0;i<6;++i) W[i]=ans[i];
    answer(W);
}

Compilation message

scales.cpp: In function 'void init(int)':
scales.cpp:24:15: warning: unused parameter 'tc' [-Wunused-parameter]
   24 | void init(int tc)
      |           ~~~~^~
# Verdict Execution time Memory Grader output
1 Partially correct 1 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 1 ms 212 KB Output is partially correct
5 Partially correct 1 ms 300 KB Output is partially correct
6 Partially correct 1 ms 212 KB Output is partially correct
7 Partially correct 1 ms 300 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 224 KB Output is partially correct
11 Partially correct 1 ms 212 KB Output is partially correct
12 Partially correct 1 ms 212 KB Output is partially correct
13 Partially correct 1 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 1 ms 300 KB Output is partially correct
17 Partially correct 1 ms 212 KB Output is partially correct
18 Partially correct 1 ms 300 KB Output is partially correct
19 Partially correct 1 ms 212 KB Output is partially correct
20 Partially correct 1 ms 212 KB Output is partially correct
21 Partially correct 1 ms 212 KB Output is partially correct
22 Partially correct 1 ms 212 KB Output is partially correct
23 Partially correct 1 ms 212 KB Output is partially correct
24 Partially correct 1 ms 212 KB Output is partially correct
25 Partially correct 1 ms 212 KB Output is partially correct
26 Partially correct 1 ms 212 KB Output is partially correct
27 Partially correct 1 ms 212 KB Output is partially correct
28 Partially correct 1 ms 296 KB Output is partially correct
29 Partially correct 1 ms 212 KB Output is partially correct
30 Partially correct 1 ms 212 KB Output is partially correct
31 Partially correct 0 ms 304 KB Output is partially correct
32 Partially correct 1 ms 212 KB Output is partially correct
33 Partially correct 0 ms 212 KB Output is partially correct
34 Partially correct 1 ms 212 KB Output is partially correct
35 Partially correct 1 ms 296 KB Output is partially correct
36 Partially correct 1 ms 300 KB Output is partially correct
37 Partially correct 1 ms 212 KB Output is partially correct
38 Partially correct 1 ms 212 KB Output is partially correct
39 Partially correct 1 ms 340 KB Output is partially correct
40 Partially correct 1 ms 300 KB Output is partially correct