oj.uz

Submission #103892

# Submission time Handle Problem Language Result Execution time Memory
103892 2019-04-03T05:49:27 Z autumn_eel Koala Game (APIO17_koala) C++14
55 / 100
 86 ms 632 KB 
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;

#include "koala.h"

int B[200],R[200];
int minValue(int N, int W) {
	memset(B,0,sizeof(B));
	B[0]=1;
	playRound(B,R);
	rep(i,N){
		if(B[i]>=R[i])return i;
	}
	return -1;
}

int maxValue(int N, int W) {
	rep(i,N){
		B[i]=1;
	}
	playRound(B,R);
	vector<int>v;
	rep(i,N){
		if(R[i]>1){
			v.push_back(i);
		}
	}
	while(v.size()>1){
		memset(B,0,sizeof(B));
		int ave=W/v.size();
		for(int i:v)B[i]=ave;
		playRound(B,R);
		vector<int>u;
		for(int i:v){
			if(R[i]>B[i])u.push_back(i);
		}
		v=u;
	}
	return v[0];
}

bool cmp(int a,int b,int W=100){
	int l=2,r=min(W/2,8);
	while(1){
		int t=(l+r)/2;
		memset(B,0,sizeof(B));
		B[a]=B[b]=t;
		playRound(B,R);
		bool f0=(B[a]<R[a]),f1=(B[b]<R[b]);
		if(f0^f1){
			if(f0)return 0;
			return 1;
		}
		if(!f0)r=t-1;
		else l=t+1;
	}
}
int greaterValue(int N, int W) {
	if(cmp(0,1,W))return 1;
	return 0;
}

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 {
		vector<int>v;
		rep(i,N)v.push_back(i);
		sort(v.begin(),v.end(),[&](int a,int b){return cmp(a,b,W);});
		rep(i,v.size()){
			P[v[i]]=i+1;
		}
    }
}

Compilation message

koala.cpp: In function 'void allValues(int, int, int*)':
koala.cpp:2:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define rep(i,n)for(int i=0;i<(n);i++)
                              ^
koala.cpp:73:3: note: in expansion of macro 'rep'
   rep(i,v.size()){
   ^~~

Subtask #1
4.0 / 4.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
14.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 632 KB Output is correct
2 Partially correct 71 ms 428 KB Output is partially correct
3 Correct 86 ms 384 KB Output is correct
4 Correct 50 ms 504 KB Output is correct
5 Partially correct 58 ms 384 KB Output is partially correct
6 Correct 60 ms 384 KB Output is correct
7 Partially correct 67 ms 512 KB Output is partially correct
8 Correct 61 ms 384 KB Output is correct
9 Correct 57 ms 384 KB Output is correct
10 Correct 57 ms 384 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
22.0 / 53.0

# Verdict Execution time Memory Grader output
1 Partially correct 30 ms 376 KB Output is partially correct
2 Partially correct 50 ms 376 KB Output is partially correct
3 Partially correct 39 ms 300 KB Output is partially correct
4 Partially correct 41 ms 384 KB Output is partially correct
5 Partially correct 44 ms 384 KB Output is partially correct
6 Partially correct 38 ms 416 KB Output is partially correct
7 Partially correct 38 ms 384 KB Output is partially correct
8 Partially correct 56 ms 384 KB Output is partially correct
9 Partially correct 43 ms 504 KB Output is partially correct
10 Partially correct 34 ms 384 KB Output is partially correct
11 Partially correct 36 ms 384 KB Output is partially correct
12 Partially correct 27 ms 384 KB Output is partially correct
13 Partially correct 38 ms 384 KB Output is partially correct
14 Partially correct 40 ms 384 KB Output is partially correct
15 Partially correct 40 ms 384 KB Output is partially correct
16 Partially correct 39 ms 356 KB Output is partially correct
17 Partially correct 42 ms 384 KB Output is partially correct
18 Partially correct 39 ms 384 KB Output is partially correct
19 Partially correct 37 ms 384 KB Output is partially correct
20 Partially correct 46 ms 384 KB Output is partially correct
21 Partially correct 33 ms 384 KB Output is partially correct
22 Partially correct 40 ms 408 KB Output is partially correct
23 Partially correct 31 ms 376 KB Output is partially correct
24 Partially correct 39 ms 384 KB Output is partially correct
25 Partially correct 40 ms 384 KB Output is partially correct
26 Partially correct 49 ms 416 KB Output is partially correct
27 Partially correct 38 ms 384 KB Output is partially correct
28 Partially correct 49 ms 504 KB Output is partially correct
29 Partially correct 36 ms 384 KB Output is partially correct
30 Partially correct 39 ms 384 KB Output is partially correct
31 Partially correct 47 ms 432 KB Output is partially correct
32 Partially correct 37 ms 384 KB Output is partially correct
33 Partially correct 36 ms 384 KB Output is partially correct
34 Partially correct 45 ms 384 KB Output is partially correct
35 Partially correct 42 ms 384 KB Output is partially correct
36 Partially correct 35 ms 376 KB Output is partially correct
37 Partially correct 39 ms 416 KB Output is partially correct
38 Partially correct 37 ms 384 KB Output is partially correct
39 Partially correct 38 ms 376 KB Output is partially correct
40 Partially correct 39 ms 384 KB Output is partially correct