oj.uz

답안 #99912

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
99912 2019-03-08T16:20:04 Z TadijaSebez 코알라 (APIO17_koala) C++11
61 / 100
 61 ms 524 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, int val=0){ for(int i=0;i<N;i++) A[i]=val;}
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=0,bot=1,mid;
	while((top+1)*(top+2)/2<N) top++;
	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;
}
bool comp(int x, int y, int N, int W)
{
	Clear(N);
	A[x]=A[y]=W/2;
	playRound(A,B);
	if(A[x]<B[x]) return 0;
	else return 1;
}
bool comp2(int x, int y, int N, int W)
{
	int top=0,bot=1,mid;
	while((top+1)*(top+2)/2<N) top++;
	while(top>=bot)
	{
		mid=top+bot>>1;
		Clear(N);
		A[x]=A[y]=mid;
		playRound(A,B);
		if(B[x]>A[x] && B[y]>A[y]) bot=mid+1;
		else if(B[x]<=A[x] && B[y]<=A[y]) top=mid-1;
		else break;
	}
	if(A[x]<B[x]) return 0;
	else return 1;
}
int C[N];
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.
		for(int i=0;i<N;i++) C[i]=i;
		sort(C,C+N,[&](int x, int y){ return comp(x,y,N,W);});
		for(int i=0;i<N;i++) P[C[i]]=i+1;
	} else {
		// TODO: Implement Subtask 5 solution here.
		// You may leave this block unmodified if you are not attempting this
		// subtask.
		for(int i=0;i<N;i++) C[i]=i;
		sort(C,C+N,[&](int x, int y){ return comp2(x,y,N,W);});
		for(int i=0;i<N;i++) P[C[i]]=i+1;
	}
}

Compilation message

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

Subtask #1
4.0 / 4.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 456 KB Output is correct
2 Correct 61 ms 524 KB Output is correct
3 Correct 53 ms 384 KB Output is correct
4 Correct 44 ms 384 KB Output is correct
5 Correct 48 ms 504 KB Output is correct
6 Correct 54 ms 384 KB Output is correct
7 Correct 52 ms 512 KB Output is correct
8 Correct 51 ms 384 KB Output is correct
9 Correct 46 ms 424 KB Output is correct
10 Correct 47 ms 384 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 376 KB Output is correct
2 Incorrect 44 ms 504 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
24.0 / 53.0

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