oj.uz

답안 #603288

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
603288 2022-07-23T21:38:12 Z StrawHatWess 저울 (IOI15_scales) C++17
55.5556 / 100
 1 ms 468 KB 
#include "scales.h"

#include <bits/stdc++.h>
using namespace std;

#define FOR(i,a,b) for(int i=a; i<b; i++)
#define ROF(i,a,b) for(int i=b-1; i>=a; i--)

typedef vector<int>vi; 
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x),end(x)


//------

void init(int T) {
    
    return;
}

void orderCoins() {
    int a=getLightest(1,2,3), x=getLightest(4,5,6);
    int b; ROF(i,1,4) if(i!=a) b=i; 
    int c; ROF(i,1,4) if(i!=a && i!=b) c=i; 
    int y; ROF(i,4,7) if(i!=x) y=i; 
    int z; ROF(i,4,7) if(i!=x && i!=y) z=i; 


    int k=getNextLightest(b,c,x,a); 

    vi order; 
    if(k==x){
    	int l=getMedian(k,b,c); 
    	int m=b; if(l==b) m=c; 
    	order={a,k,l,m}; 
    }
    else{
    	if(k==c) swap(b,c); 

    	int l=getMedian(b,c,x);
    	if(l==b) order={x,a,b,c}; 
    	else if(l==x) order={a,b,x,c}; 
    	else order={a,b,c,x}; 
    }



    a=order[0], b=order[1], c=order[2]; int d=order[3]; 
    k=getNextLightest(a,b,c,y); 

    if(k==b){
    	order={a,y,b,c,d}; 
    }
    else if(k==c){
    	order={a,b,y,c,d}; 
    }
    else{
    	k=getMedian(a,d,y); 
    	if(k==y) order={a,b,c,y,d}; 
    	else order={a,b,c,d,y}; 
    }




    a=order[0], b=order[1], c=order[2], d=order[3]; int e=order[4]; 
    k=getNextLightest(a,b,c,z); 

    if(k==b){
    	order={a,z,b,c,d,e}; 
    }
    else if(k==c){
    	order={a,b,z,c,d,e}; 
    }
    else{
    	k=getNextLightest(a,d,e,z); 
    	if(k==d) order={a,b,c,z,d,e}; 
    	else if(k==e) order={a,b,c,d,z,e};
    	else order={a,b,c,d,e,z};  
    }


    int W[] = {order[0], order[1], order[2], order[3], order[4], order[5]};
    answer(W);
}

Compilation message

scales.cpp: In function 'void init(int)':
scales.cpp:17:15: warning: unused parameter 'T' [-Wunused-parameter]
   17 | void init(int T) {
      |           ~~~~^
scales.cpp: In function 'void orderCoins()':
scales.cpp:71:11: warning: 'z' may be used uninitialized in this function [-Wmaybe-uninitialized]
   71 |      order={a,z,b,c,d,e};
      |      ~~~~~^~~~~~~~~~~~~~
scales.cpp:34:21: warning: 'c' may be used uninitialized in this function [-Wmaybe-uninitialized]
   34 |      int l=getMedian(k,b,c);
      |            ~~~~~~~~~^~~~~~~

Subtask #1
55.555556 / 100.0

# 결과 실행 시간 메모리 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 300 KB Output is partially correct
7 Partially correct 0 ms 212 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 212 KB Output is partially correct
11 Partially correct 1 ms 212 KB Output is partially correct
12 Partially correct 1 ms 292 KB Output is partially correct
13 Partially correct 1 ms 300 KB Output is partially correct
14 Partially correct 1 ms 212 KB Output is partially correct
15 Partially correct 1 ms 212 KB Output is partially correct
16 Partially correct 1 ms 212 KB Output is partially correct
17 Partially correct 0 ms 300 KB Output is partially correct
18 Partially correct 1 ms 212 KB Output is partially correct
19 Partially correct 1 ms 212 KB Output is partially correct
20 Partially correct 0 ms 304 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 1 ms 296 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 1 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 1 ms 212 KB Output is partially correct
33 Partially correct 1 ms 468 KB Output is partially correct
34 Partially correct 1 ms 212 KB Output is partially correct
35 Partially correct 1 ms 212 KB Output is partially correct
36 Partially correct 1 ms 212 KB Output is partially correct
37 Partially correct 1 ms 300 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 1 ms 292 KB Output is partially correct