oj.uz

답안 #206396

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
206396 2020-03-03T08:16:49 Z batmend 저울 (IOI15_scales) C++14
0 / 100
 5 ms 376 KB 
#include "scales.h"
#include<bits/stdc++.h>
using namespace std;

int ma;
int med;
int val0, val1, val2, val3;


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

void orderCoins() {
    /* ... */
    int pos[7] = {0, 0, 1, 2, 3, 4, 5};
    int W[6] = {1, 2, 3, 4, 5, 6};
	/*
    ma = getHeaviest(1, 2, 3);
    swap(W[ma], W[2]);
    swap(pos[ma], pos[2]);
    ma = getHeaviest(4, 5, 6);
    swap(W[ma], W[5]);
    swap(pos[ma], pos[5]);
    

    ma = getHeaviest(W[1], W[2], W[5]);
    bool w2wasmax = 0;
    if (ma == W[2]) {
    	swap(pos[W[2]], pos[W[5]]);
    	swap(W[2], W[5]);
    	w2wasmax = 1;
    }
    if (w2wasmax == 1) {
    	ma = getHeaviest(W[0], W[1], W[2]);
    }
    if (w2wasmax == 0) {
    	ma = getHeaviest(W[3], W[4], W[2]);
    }
    int val = W[4];
    swap(W[pos[ma]], W[4]);
    swap(pos[val], pos[ma]);

    ma = getHeaviest(W[1], W[2], W[3]);
    val = W[3];
    swap(W[pos[ma]], W[3]);
    swap(pos[ma], pos[val]);
    med = getMedian(W[0], W[1], W[3]);
    val0 = W[0];
    val1 = W[1];
    val3 = W[3];
    if (med == val0) {
		swap(pos[W[0]], pos[W[1]]);
		swap(W[0], W[1]);
    }
    if (med == val3) {
			swap(pos[W[3]], pos[W[0]]);
			swap(W[0], W[3]);
			swap(pos[W[3]], pos[W[1]]);
			swap(W[1], W[3]);
    }
    med = getMedian(W[0], W[1], W[2]);
    val0 = W[0];
    val1 = W[1]; 
    val2 = W[2];
	if (med == val0) {
			swap(pos[W[0]], pos[W[2]]);
			swap(W[0], W[2]);
			swap(pos[W[1]], pos[W[0]]);
			swap(W[1], W[0]);
    }
    if (med == val2) {
			swap(pos[W[1]], pos[W[2]]);
			swap(W[1], W[2]);
    }
    */
	answer(W);
}

Compilation message

scales.cpp: In function 'void init(int)':
scales.cpp:10:15: warning: unused parameter 'T' [-Wunused-parameter]
 void init(int T) {
               ^
scales.cpp: In function 'void orderCoins()':
scales.cpp:16:9: warning: unused variable 'pos' [-Wunused-variable]
     int pos[7] = {0, 0, 1, 2, 3, 4, 5};
         ^~~

Subtask #1
0.0 / 100.0

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