oj.uz

Submission #948625

# Submission time Handle Problem Language Result Execution time Memory
948625 2024-03-18T08:58:55 Z MilosMilutinovic Koala Game (APIO17_koala) C++14
76 / 100
 46 ms 720 KB 
#include "koala.h"
#include<bits/stdc++.h>

#define pb push_back

using namespace std;

int minValue(int n,int w){
	int a[n],b[n];
	for(int i=0;i<n;i++) a[i]=0;
	a[0]=1;
	playRound(a,b);
	for(int i=0;i<n;i++) if(a[i]>=b[i]) return i;
}

int maxValue(int n,int w){
	vector<int> c;
	for(int i=0;i<n;i++) c.pb(i);
	while((int)c.size()>1){
		int a[n],b[n];
		for(int i=0;i<n;i++) a[i]=0;
		for(int i:c) a[i]=w/(int)c.size();
		playRound(a,b);
		c.clear();
		for(int i=0;i<n;i++) if(b[i]>a[i]&&a[i]>0) c.pb(i);
	}
	return c[0];
}

int greaterValue(int n,int w){
	int low=1,high=min(10,w/2);
	while(low<=high){
		int mid=(low+high)/2;
		int a[n],b[n];
		for(int i=0;i<n;i++) a[i]=0;
		a[0]=a[1]=mid;
		playRound(a,b);
		if(b[0]>mid&&b[1]>mid) low=mid+1;
		else if(b[0]<=mid&&b[1]<=mid) high=mid-1;
		else return (b[0]>mid?0:1);
	}
	return 0;
}

void allValues(int n,int w,int *p){
	if(w==2*n){
		auto cmp=[&](int x,int y){
			int a[n],b[n];
			for(int i=0;i<n;i++) a[i]=0;
			a[x]=a[y]=w/2;
			playRound(a,b);
			return b[x]<b[y];
		};
		function<vector<int>(int,int)> solve=[&](int l,int r){
			if(l==r) return vector<int>(1,l);
			int mid=(l+r)/2;
			vector<int> vl=solve(l,mid);
			vector<int> vr=solve(mid+1,r);
			vector<int> ret;
			int i=0,j=0,x=(int)vl.size(),y=(int)vr.size();
			while(i<x||j<y){
				if(i==x||(j<y&&!cmp(vl[i],vr[j]))) ret.pb(vr[j++]);
				else ret.pb(vl[i++]);
			}
			return ret;
		};
		vector<int> res=solve(0,n-1);
		for(int i=0;i<n;i++) p[res[i]]=i+1;
	}else{
		auto cmp=[&](int x,int y){
			int low=1,high=min(11,w/2);
			while(low<=high){
				int mid=(low+high)/2;
				int a[n],b[n];
				for(int i=0;i<n;i++) a[i]=0;
				a[x]=a[y]=mid;
				playRound(a,b);
				if(b[x]>mid&&b[y]>mid) low=mid+1;
				else if(b[x]<=mid&&b[y]<=mid) high=mid-1;
				else return (b[x]>mid?false:true);
			}
			assert(false);
		};
		function<vector<int>(int,int)> solve=[&](int l,int r){
			if(l==r) return vector<int>(1,l);
			int mid=(l+r)/2;
			vector<int> vl=solve(l,mid);
			vector<int> vr=solve(mid+1,r);
			vector<int> ret;
			int i=0,j=0,x=(int)vl.size(),y=(int)vr.size();
			while(i<x||j<y){
				if(i==x||(j<y&&!cmp(vl[i],vr[j]))) ret.pb(vr[j++]);
				else ret.pb(vl[i++]);
			}
			return ret;
		};
		vector<int> res=solve(0,n-1);
		for(int i=0;i<n;i++) p[res[i]]=i+1;
	}
}

Compilation message

koala.cpp: In function 'int minValue(int, int)':
koala.cpp:14:1: warning: control reaches end of non-void function [-Wreturn-type]
   14 | }
      | ^

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 344 KB Output is correct
2 Correct 3 ms 344 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Correct 3 ms 344 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 344 KB Output is correct
2 Correct 10 ms 344 KB Output is correct
3 Correct 10 ms 344 KB Output is correct
4 Correct 10 ms 344 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 484 KB Output is correct
2 Correct 46 ms 472 KB Output is correct
3 Correct 42 ms 720 KB Output is correct
4 Correct 38 ms 468 KB Output is correct
5 Correct 40 ms 452 KB Output is correct
6 Correct 39 ms 596 KB Output is correct
7 Correct 39 ms 464 KB Output is correct
8 Correct 39 ms 484 KB Output is correct
9 Correct 39 ms 464 KB Output is correct
10 Correct 38 ms 452 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 344 KB Output is correct
2 Correct 26 ms 344 KB Output is correct
3 Correct 25 ms 344 KB Output is correct
4 Correct 31 ms 344 KB Output is correct
5 Correct 25 ms 344 KB Output is correct
6 Correct 25 ms 344 KB Output is correct
7 Correct 25 ms 344 KB Output is correct
8 Correct 24 ms 344 KB Output is correct
9 Correct 24 ms 344 KB Output is correct
10 Correct 24 ms 344 KB Output is correct
11 Correct 25 ms 452 KB Output is correct
12 Correct 14 ms 452 KB Output is correct
13 Correct 25 ms 456 KB Output is correct
14 Correct 23 ms 344 KB Output is correct
15 Correct 25 ms 452 KB Output is correct
16 Correct 23 ms 344 KB Output is correct
17 Correct 21 ms 596 KB Output is correct
18 Correct 22 ms 344 KB Output is correct
19 Correct 26 ms 448 KB Output is correct
20 Correct 23 ms 448 KB Output is correct

Subtask #5
29.0 / 53.0

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