oj.uz

답안 #120193

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
120193 2019-06-23T17:05:25 Z pavel 저울 (IOI15_scales) C++14
38.4615 / 100
 3 ms 384 KB 
#include <vector>
#include <cstdio>
#include "scales.h"

using namespace std;

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

void orderCoins() {
    int W[] = {1, 2, 3, 4, 5, 6};

    vector<vector<int>> v;
    for(int i=1;i<=6;++i) v.push_back(vector<int>(1, i));
    vector<int> sol;
    while(true){
        if(v.size()==3){
            int a = getLightest(v[0].back(), v[1].back(), v[2].back());
            int b = getMedian(v[0].back(), v[1].back(), v[2].back());
            for(int i=0;i<3;++i){
                if(a==v[i].back()){
                    sol.insert(sol.end(), v[i].begin(), v[i].end());
                }
            }
            for(int i=0;i<3;++i){
                if(b==v[i].back()){
                    sol.insert(sol.end(), v[i].begin(), v[i].end());
                }
            }
            for(int i=0;i<3;++i){
                if(v[i].back()!=a && v[i].back()!=b){
                    sol.insert(sol.end(), v[i].begin(), v[i].end());
                }
            }
            break;
        }else{
            int med = getMedian(v[0].back(), v[1].back(), v[2].back());
            vector<vector<int>> nm;
            vector<int> medv;
            for(auto i:v){
                if(i.back()!=med){
                    nm.push_back(i);
                }else{
                    medv=i;
                }    
            }
            int y = getNextLightest(nm[0].back(), nm[1].back(), nm[2].back(), med);
            if(v.size()>4){
                if(y==nm[nm.size()-2].back()) y = getNextLightest(y, nm[nm.size()-1].back(), nm[0].back(), med);
                else y = getNextLightest(y, nm[nm.size()-1].back(), nm[nm.size()-2].back(), med);
            }
            
            vector<vector<int>> nxtv;
            for(auto i:nm){
                if(i.back()!=y){
                    nxtv.push_back(i);
                }else{
                    medv.insert(medv.end(), i.begin(), i.end());
                    nxtv.push_back(medv);
                }
            }
            v=nxtv;
        }
    }
    for(int i=0;i<6;++i) W[i]=sol[i];
    answer(W);
}

Compilation message

In file included from grader.c:2:0:
graderlib.c: In function 'void answer(int*)':
graderlib.c:53:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
     if (_ghksjhdfkae19ga_ > 1) 
     ^~
graderlib.c:56:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  for (i = 0; i < 6; i++) {
  ^~~
scales.cpp: In function 'void init(int)':
scales.cpp:7:15: warning: unused parameter 'T' [-Wunused-parameter]
 void init(int T) {
               ^

Subtask #1
38.461538 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 2 ms 384 KB Output is partially correct
2 Partially correct 2 ms 384 KB Output is partially correct
3 Partially correct 2 ms 384 KB Output is partially correct
4 Partially correct 2 ms 256 KB Output is partially correct
5 Partially correct 2 ms 384 KB Output is partially correct
6 Partially correct 2 ms 384 KB Output is partially correct
7 Partially correct 2 ms 256 KB Output is partially correct
8 Partially correct 3 ms 384 KB Output is partially correct
9 Partially correct 2 ms 256 KB Output is partially correct
10 Partially correct 2 ms 256 KB Output is partially correct
11 Partially correct 2 ms 384 KB Output is partially correct
12 Partially correct 2 ms 256 KB Output is partially correct
13 Partially correct 2 ms 128 KB Output is partially correct
14 Partially correct 3 ms 256 KB Output is partially correct
15 Partially correct 2 ms 384 KB Output is partially correct
16 Partially correct 2 ms 384 KB Output is partially correct
17 Partially correct 2 ms 384 KB Output is partially correct
18 Partially correct 2 ms 384 KB Output is partially correct
19 Partially correct 2 ms 384 KB Output is partially correct
20 Partially correct 2 ms 256 KB Output is partially correct
21 Partially correct 2 ms 256 KB Output is partially correct
22 Partially correct 2 ms 256 KB Output is partially correct
23 Partially correct 2 ms 384 KB Output is partially correct
24 Partially correct 2 ms 384 KB Output is partially correct
25 Partially correct 2 ms 256 KB Output is partially correct
26 Partially correct 2 ms 384 KB Output is partially correct
27 Partially correct 2 ms 256 KB Output is partially correct
28 Partially correct 2 ms 256 KB Output is partially correct
29 Partially correct 2 ms 256 KB Output is partially correct
30 Partially correct 2 ms 384 KB Output is partially correct
31 Partially correct 2 ms 256 KB Output is partially correct
32 Partially correct 2 ms 384 KB Output is partially correct
33 Partially correct 2 ms 384 KB Output is partially correct
34 Partially correct 2 ms 384 KB Output is partially correct
35 Partially correct 2 ms 384 KB Output is partially correct
36 Partially correct 2 ms 256 KB Output is partially correct
37 Partially correct 3 ms 384 KB Output is partially correct
38 Partially correct 2 ms 384 KB Output is partially correct
39 Partially correct 2 ms 256 KB Output is partially correct
40 Partially correct 2 ms 256 KB Output is partially correct