oj.uz

Submission #99918

# Submission time Handle Problem Language Result Execution time Memory
99918 2019-03-08T17:47:46 Z TadijaSebez Koala Game (APIO17_koala) C++11
86 / 100
 82 ms 632 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;
	if(A[y]<B[y]) 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],D[N];
void MergeSort(int l, int r, function<bool(int,int)> cmp)
{
	if(l==r) return;
	int mid=l+r>>1;
	MergeSort(l,mid,cmp);
	MergeSort(mid+1,r,cmp);
	int i=l,j=mid+1,k=l;
	while(i<=mid || j<=r)
	{
		if(i>mid) D[k++]=C[j++];
		else if(j>r) D[k++]=C[i++];
		else if(cmp(C[i],C[j])) D[k++]=C[i++];
		else D[k++]=C[j++];
	}
	for(i=l;i<=r;i++) C[i]=D[i];
}
void QuickSort(int l, int r, function<bool(int,int)> cmp)
{
	if(l>=r) return;
	if(r-l<=4 && 0)
	{
		for(int i=l+1,j;i<=r;i++)
		{
			int tmp=C[i];
			for(j=i-1;j>=l;j--)
			{
				if(cmp(tmp,C[j])) C[j+1]=C[j];
				else break;
			}
			C[j+1]=tmp;
		}
		return;
	}
	int pivot=rand()%(r-l+1)+l;
	swap(C[pivot],C[r]);
	int i,j=l;
	for(i=l;i<r;i++)
	{
		if(cmp(C[i],C[r])) swap(C[i],C[j++]);
	}
	QuickSort(l,j-1,cmp);
	QuickSort(j,r,cmp);
}
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;
		MergeSort(0,N-1,[&](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.
		vector<int> was;
		vector<bool> done(N,0);
		int i;
		for(i=1;i<=N;i++)
		{
			int sz=i,f=N-i+1;
			int ost=sz%f;
			int all=sz/f;
			Clear(N);
			for(int j=0;j<N;j++) if(!done[j]) A[j]+=all;
			for(int j=0;j<N;j++) if(!done[j] && ost) A[j]++,ost--;
            int sum=0;
            for(int j=0;j<N;j++) sum+=A[j];
            if(i>1)
			{
				int rem=W-sum;
				all=rem/(i-1);
				ost=rem%(i-1);
				for(int j=0;j<N;j++) if(done[j]) A[j]+=all;
				for(int j=0;j<N;j++) if(done[j] && ost) A[j]++,ost--;
			}
			playRound(A,B);
			int ok=0;
			for(int j=0;j<N;j++)
			{
				if(!done[j] && A[j]>=B[j]) ok++;
				if(done[j] && A[j]<B[j]) ok=5;
			}
			if(ok!=1) break;
			for(int j=0;j<N;j++) if(!done[j] && A[j]>=B[j]){ was.push_back(j);done[j]=1;break;}
		}
		int j=0;
		for(int i=0;i<N;i++) if(!done[i]) C[j++]=i;
		MergeSort(0,j-1,[&](int x, int y){ return comp2(x,y,N,W);});
		//printf("j: %i\n",j);
		//for(int i=0;i<j;i++) printf("%i ",C[i]);printf("\n");
		for(int i=0;i<j;i++) was.push_back(C[i]);
		for(int i=0;i<N;i++) P[was[i]]=i+1;
		/*srand(time(0));
		Clear(N,1);
		playRound(A,B);
		int j=0;
		for(int i=0;i<N;i++) if(B[i]<=A[i]) C[j++]=i;
		int h=j;
		for(int i=0;i<N;i++) if(B[i]>A[i]) C[j++]=i;
		Clear(N);
		A[0]=1;
		playRound(A,B);
		int mn;
		for(int i=0;i<N;i++) if(A[i]>=B[i]) mn=i;
		for(int i=0;i<N;i++) if(C[i]==mn) swap(C[i],C[0]);
		MergeSort(1,h-1,[&](int x, int y){ return comp2(x,y,N,W);});
		MergeSort(h,N-1,[&](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;
       ~~~^~~~
koala.cpp: In function 'void MergeSort(int, int, std::function<bool(int, int)>)':
koala.cpp:85:11: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=l+r>>1;
          ~^~
koala.cpp: In function 'bool comp(int, int, int, int)':
koala.cpp:63:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 7 ms 392 KB Output is correct
3 Correct 7 ms 384 KB Output is correct
4 Correct 7 ms 384 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 384 KB Output is correct
2 Correct 15 ms 384 KB Output is correct
3 Correct 16 ms 384 KB Output is correct
4 Correct 15 ms 512 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 452 KB Output is correct
2 Correct 62 ms 388 KB Output is correct
3 Correct 43 ms 384 KB Output is correct
4 Correct 54 ms 632 KB Output is correct
5 Correct 51 ms 632 KB Output is correct
6 Correct 48 ms 384 KB Output is correct
7 Correct 53 ms 512 KB Output is correct
8 Correct 66 ms 384 KB Output is correct
9 Correct 82 ms 384 KB Output is correct
10 Correct 47 ms 512 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 504 KB Output is correct
2 Correct 30 ms 384 KB Output is correct
3 Correct 32 ms 376 KB Output is correct
4 Correct 34 ms 384 KB Output is correct
5 Correct 30 ms 384 KB Output is correct
6 Correct 32 ms 384 KB Output is correct
7 Correct 35 ms 384 KB Output is correct
8 Correct 32 ms 384 KB Output is correct
9 Correct 34 ms 376 KB Output is correct
10 Correct 48 ms 384 KB Output is correct
11 Correct 28 ms 376 KB Output is correct
12 Correct 17 ms 384 KB Output is correct
13 Correct 28 ms 384 KB Output is correct
14 Correct 25 ms 384 KB Output is correct
15 Correct 28 ms 384 KB Output is correct
16 Correct 27 ms 384 KB Output is correct
17 Correct 28 ms 384 KB Output is correct
18 Correct 36 ms 384 KB Output is correct
19 Correct 38 ms 380 KB Output is correct
20 Correct 27 ms 380 KB Output is correct

Subtask #5
39.0 / 53.0

# Verdict Execution time Memory Grader output
1 Partially correct 9 ms 384 KB Output is partially correct
2 Partially correct 13 ms 384 KB Output is partially correct
3 Partially correct 12 ms 384 KB Output is partially correct
4 Partially correct 12 ms 384 KB Output is partially correct
5 Partially correct 16 ms 384 KB Output is partially correct
6 Partially correct 12 ms 384 KB Output is partially correct
7 Partially correct 11 ms 256 KB Output is partially correct
8 Partially correct 12 ms 384 KB Output is partially correct
9 Partially correct 10 ms 384 KB Output is partially correct
10 Partially correct 10 ms 384 KB Output is partially correct
11 Partially correct 12 ms 384 KB Output is partially correct
12 Partially correct 7 ms 384 KB Output is partially correct
13 Partially correct 10 ms 384 KB Output is partially correct
14 Partially correct 12 ms 384 KB Output is partially correct
15 Partially correct 12 ms 384 KB Output is partially correct
16 Partially correct 11 ms 384 KB Output is partially correct
17 Partially correct 15 ms 384 KB Output is partially correct
18 Partially correct 10 ms 384 KB Output is partially correct
19 Partially correct 17 ms 384 KB Output is partially correct
20 Partially correct 11 ms 384 KB Output is partially correct
21 Partially correct 12 ms 384 KB Output is partially correct
22 Partially correct 12 ms 384 KB Output is partially correct
23 Partially correct 9 ms 384 KB Output is partially correct
24 Partially correct 10 ms 384 KB Output is partially correct
25 Partially correct 12 ms 384 KB Output is partially correct
26 Partially correct 11 ms 384 KB Output is partially correct
27 Partially correct 11 ms 384 KB Output is partially correct
28 Partially correct 18 ms 384 KB Output is partially correct
29 Partially correct 14 ms 384 KB Output is partially correct
30 Partially correct 12 ms 384 KB Output is partially correct
31 Partially correct 11 ms 384 KB Output is partially correct
32 Partially correct 11 ms 416 KB Output is partially correct
33 Partially correct 13 ms 384 KB Output is partially correct
34 Partially correct 10 ms 384 KB Output is partially correct
35 Partially correct 13 ms 384 KB Output is partially correct
36 Partially correct 13 ms 384 KB Output is partially correct
37 Partially correct 11 ms 384 KB Output is partially correct
38 Partially correct 9 ms 384 KB Output is partially correct
39 Partially correct 9 ms 384 KB Output is partially correct
40 Partially correct 9 ms 384 KB Output is partially correct