oj.uz

답안 #99907

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
99907 2019-03-08T15:50:39 Z TadijaSebez 코알라 (APIO17_koala) C++11
30 / 100
 122 ms 760 KB 
#include "koala.h"
#include <bits/stdc++.h>
using namespace std;
const int N=105;
int A[N],B[N];
int minValue(int N, int W) {
	// TODO: Implement Subtask 1 solution here.
	// You may leave this function unmodified if you are not attempting this
	// subtask.
	A[0]=1;
	for(int i=1;i<N;i++) A[i]=0;
	playRound(A,B);
	for(int i=0;i<N;i++) if(A[i]>=B[i]) return i;
	return -1;
}

void Clear(int N){ for(int i=0;i<N;i++) A[i]=0;}
int maxValue(int N, int W) {
	// TODO: Implement Subtask 2 solution here.
	// You may leave this function unmodified if you are not attempting this
	// subtask.
	vector<int> cand(N);
	for(int i=0;i<N;i++) cand[i]=i;
	while(cand.size()>1)
	{
		Clear(N);
		int mx=0;while((mx+1)*(mx+2)/2<N) mx++;
		int put=min(W/(int)cand.size(),mx-1);
		for(int i:cand) A[i]=put;
		playRound(A,B);
		cand.clear();
		for(int i=0;i<N;i++) if(A[i]>0 && B[i]>A[i]) cand.push_back(i);
	}
	return cand[0];
}

int greaterValue(int N, int W) {
	// TODO: Implement Subtask 3 solution here.
	// You may leave this function unmodified if you are not attempting this
	// subtask.
	int top=W/2,bot=1,mid;
	while(top>=bot)
	{
		mid=top+bot>>1;
		Clear(N);
		A[0]=A[1]=mid;
		playRound(A,B);
		if(B[0]>A[0] && B[1]>A[1]) bot=mid+1;
		else if(B[0]<=A[0] && B[1]<=A[1]) top=mid-1;
		else break;
	}
	if(A[0]<B[0]) return 0;
	else return 1;
}

void allValues(int N, int W, int *P) {
	if (W == 2*N) {
		// TODO: Implement Subtask 4 solution here.
		// You may leave this block unmodified if you are not attempting this
		// subtask.
	} else {
		// TODO: Implement Subtask 5 solution here.
		// You may leave this block unmodified if you are not attempting this
		// subtask.
	}
}

Compilation message

koala.cpp: In function 'int greaterValue(int, int)':
koala.cpp:44:10: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   mid=top+bot>>1;
       ~~~^~~~

Subtask #1
4.0 / 4.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
11.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 122 ms 448 KB Output is partially correct
2 Partially correct 84 ms 640 KB Output is partially correct
3 Partially correct 113 ms 760 KB Output is partially correct
4 Partially correct 94 ms 760 KB Output is partially correct
5 Partially correct 84 ms 760 KB Output is partially correct
6 Partially correct 97 ms 752 KB Output is partially correct
7 Partially correct 102 ms 760 KB Output is partially correct
8 Partially correct 102 ms 760 KB Output is partially correct
9 Partially correct 107 ms 760 KB Output is partially correct
10 Partially correct 87 ms 760 KB Output is partially correct

Subtask #4
0 / 10.0

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

Subtask #5
0 / 53.0

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