oj.uz

Submission #958737

# Submission time Handle Problem Language Result Execution time Memory
958737 2024-04-06T13:15:52 Z MilosMilutinovic Koala Game (APIO17_koala) C++14
100 / 100
 45 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{
		vector<int> ids;
		for(int i=0;i<n;i++) ids.pb(i);
		function<void(vector<int>,int,int)> solve=[&](vector<int> v,int l,int r){
			if(l==r) return (void)(p[v[0]]=l);
			int val=min(w/(r-l+1),(int)sqrt(2*l));
			int a[n],b[n];
			for(int i=0;i<n;i++) a[i]=0;
			for(int i:v) a[i]=val;
			playRound(a,b);
			vector<int> x,y;
			for(int i:v){
				if(b[i]>a[i]) y.pb(i);
				else x.pb(i);
			}
			solve(x,l,l+x.size()-1);
			solve(y,r-y.size()+1,r);
		};
		solve(ids,1,n);
	}
}

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 4 ms 344 KB Output is correct
2 Correct 3 ms 344 KB Output is correct
3 Correct 3 ms 340 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 452 KB Output is correct
3 Correct 10 ms 352 KB Output is correct
4 Correct 12 ms 344 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 436 KB Output is correct
2 Correct 44 ms 460 KB Output is correct
3 Correct 41 ms 720 KB Output is correct
4 Correct 41 ms 484 KB Output is correct
5 Correct 41 ms 480 KB Output is correct
6 Correct 41 ms 464 KB Output is correct
7 Correct 45 ms 500 KB Output is correct
8 Correct 43 ms 480 KB Output is correct
9 Correct 41 ms 484 KB Output is correct
10 Correct 41 ms 488 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 600 KB Output is correct
2 Correct 26 ms 452 KB Output is correct
3 Correct 26 ms 344 KB Output is correct
4 Correct 25 ms 344 KB Output is correct
5 Correct 24 ms 544 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 28 ms 344 KB Output is correct
10 Correct 24 ms 344 KB Output is correct
11 Correct 25 ms 344 KB Output is correct
12 Correct 14 ms 344 KB Output is correct
13 Correct 25 ms 344 KB Output is correct
14 Correct 23 ms 452 KB Output is correct
15 Correct 23 ms 344 KB Output is correct
16 Correct 24 ms 344 KB Output is correct
17 Correct 23 ms 344 KB Output is correct
18 Correct 28 ms 428 KB Output is correct
19 Correct 26 ms 344 KB Output is correct
20 Correct 23 ms 344 KB Output is correct

Subtask #5
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 596 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 500 KB Output is correct
5 Correct 3 ms 344 KB Output is correct
6 Correct 3 ms 344 KB Output is correct
7 Correct 3 ms 344 KB Output is correct
8 Correct 3 ms 344 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 3 ms 464 KB Output is correct
14 Correct 3 ms 344 KB Output is correct
15 Correct 3 ms 344 KB Output is correct
16 Correct 3 ms 344 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 3 ms 344 KB Output is correct
20 Correct 3 ms 344 KB Output is correct
21 Correct 3 ms 344 KB Output is correct
22 Correct 3 ms 344 KB Output is correct
23 Correct 3 ms 344 KB Output is correct
24 Correct 3 ms 344 KB Output is correct
25 Correct 3 ms 340 KB Output is correct
26 Correct 3 ms 344 KB Output is correct
27 Correct 3 ms 452 KB Output is correct
28 Correct 3 ms 344 KB Output is correct
29 Correct 3 ms 344 KB Output is correct
30 Correct 3 ms 344 KB Output is correct
31 Correct 3 ms 344 KB Output is correct
32 Correct 3 ms 344 KB Output is correct
33 Correct 3 ms 344 KB Output is correct
34 Correct 3 ms 344 KB Output is correct
35 Correct 3 ms 344 KB Output is correct
36 Correct 3 ms 344 KB Output is correct
37 Correct 3 ms 344 KB Output is correct
38 Correct 3 ms 344 KB Output is correct
39 Correct 3 ms 344 KB Output is correct
40 Correct 3 ms 344 KB Output is correct