oj.uz

답안 #115449

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
115449 2019-06-07T13:50:41 Z 김세빈(#2863) 코알라 (APIO17_koala) C++14
47 / 100
 72 ms 504 KB 
#include <bits/stdc++.h>

#include "koala.h"

using namespace std;

int minValue(int n, int w)
{
	int B[111], R[111];
	int i;
	
	for(i=0; i<n; i++){
		B[i] = 1;
	}
	
	playRound(B, R);
	
	for(i=0; i<n; i++){
		if(R[i] == 2) break;
		B[i] = 0;
	}
	
	B[i] = 1;
	
	for(i++; i<n; i++){
		B[i] = 0;
	}
	
	playRound(B, R);
	
	for(i=0; i<n; i++){
		if(!R[i]) return i;
	}
	
    return 0;
}

int maxValue(int n, int w)
{
	int B[111], R[111];
	int i, s, k;
	
	for(i=0; i<n; i++){
		B[i] = 1;
	}
	
	for(k=1, s=n; s>1; ){
		for(i=0; i<n; i++){
			B[i] *= k;
		}
		
		playRound(B, R);
		
		for(i=0, s=0; i<n; i++){
			if(B[i] == k && R[i] > k){
				B[i] = 1; s ++;
			}
			else B[i] = 0;
		}
		
		k = n / s;
	}
	
	for(i=0; i<n; i++){
		if(B[i]) return i;
	}
	
	return 0;
}

int greaterValue(int n, int w)
{
	int B[111], R[111];
	int N[6] = {1, 2, 3, 4, 6, 10};
	int i, s, e, m;
	
	for(s=0, e=5; s<=e; ){
		m = s + e >> 1;
		
		for(i=0; i<n; i++){
			B[i] = 0;
		}
		
		B[0] = B[1] = N[m];
		
		playRound(B, R);
		
		if(R[0] && R[1]) s = m + 1;
		else if(!R[0] && !R[1]) e = m - 1;
		else return !R[0];
	}
	
	return 0;
}

void allValues(int n, int w, int *P)
{
	if(n + n == w){
		int D[111], B[111], R[111];
		int i, j, s, e, m;
		
		for(i=0; i<n; i++){
			for(s=0, e=i-1; s<=e; ){
				m = s + e >> 1;
				
				for(j=0; j<n; j++){
					B[j] = 0;
				}
				
				B[i] = B[D[m]] = n;
				
				playRound(B, R);
				
				if(!R[i]) e = m - 1;
				else s = m + 1;
			}
			
			for(j=i; j>e+1; j--){
				D[j] = D[j - 1];
			}
			
			D[e + 1] = i;
		}
		
		for(i=0; i<n; i++){
			P[D[i]] = i + 1;
		}
	}
	else{
	}
}

Compilation message

koala.cpp: In function 'int greaterValue(int, int)':
koala.cpp:78:9: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   m = s + e >> 1;
       ~~^~~
koala.cpp: In function 'void allValues(int, int, int*)':
koala.cpp:104:11: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
     m = s + e >> 1;
         ~~^~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 384 KB Output is correct
2 Correct 8 ms 384 KB Output is correct
3 Correct 8 ms 384 KB Output is correct
4 Correct 8 ms 384 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 384 KB Output is correct
2 Correct 13 ms 384 KB Output is correct
3 Correct 13 ms 384 KB Output is correct
4 Correct 15 ms 384 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 384 KB Output is correct
2 Correct 67 ms 384 KB Output is correct
3 Correct 66 ms 384 KB Output is correct
4 Correct 62 ms 384 KB Output is correct
5 Correct 63 ms 384 KB Output is correct
6 Correct 63 ms 384 KB Output is correct
7 Correct 63 ms 384 KB Output is correct
8 Correct 67 ms 384 KB Output is correct
9 Correct 71 ms 412 KB Output is correct
10 Correct 72 ms 504 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 384 KB Output is correct
2 Correct 27 ms 376 KB Output is correct
3 Correct 34 ms 384 KB Output is correct
4 Correct 34 ms 384 KB Output is correct
5 Correct 30 ms 504 KB Output is correct
6 Correct 28 ms 384 KB Output is correct
7 Correct 28 ms 384 KB Output is correct
8 Correct 30 ms 400 KB Output is correct
9 Correct 27 ms 384 KB Output is correct
10 Correct 28 ms 384 KB Output is correct
11 Correct 28 ms 384 KB Output is correct
12 Correct 26 ms 384 KB Output is correct
13 Correct 30 ms 384 KB Output is correct
14 Correct 27 ms 384 KB Output is correct
15 Correct 29 ms 384 KB Output is correct
16 Correct 29 ms 384 KB Output is correct
17 Correct 28 ms 384 KB Output is correct
18 Correct 31 ms 384 KB Output is correct
19 Correct 34 ms 384 KB Output is correct
20 Correct 30 ms 384 KB Output is correct

Subtask #5
0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -