oj.uz

답안 #63521

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
63521 2018-08-02T05:17:35 Z jangwonyoung 코알라 (APIO17_koala) C++14
90 / 100
 105 ms 940 KB 
#include "koala.h"
#include<iostream>
#include<algorithm>
#include<cassert>
using namespace std;
int B[100],R[100];
int mi[100],ma[100];
int n=100;
void init(){
	for(int i=0; i<n ;i++) B[i]=0,mi[i]=1,ma[i]=100;
}
int sum(int l,int r){
	if(l>r) return 0;
	return (r+l)*(r-l+1)/2;
}
int f(int l,int r,int w){
	int minv=r-l+1;
	int ans=0;
	for(int i=0; i<=w/(r-l+1) ;i++){
		int val=sum(1,n)-sum(l,r);
		int best=0;
		for(int j=1; j<=r-l+1 ;j++){
			if((i+1)*j+n-r>w) break;
			int cv=sum(r+1,n)+sum(r-j+1,r)+sum(max(1,l-(w-((i+1)*j+n-r))),l-1);
			if(cv>val || cv>=val && best!=0){
				val=cv;
				best=j;
			} 
		}
		if(best!=0 && best<minv){
			minv=best;
			ans=i;
		}
	}
	return ans;
}
int play(int l,int r,int v){
	for(int i=0; i<n ;i++){
		if(mi[i]!=l) B[i]=0;
		else B[i]=v;
	}
	playRound(B,R);
	int cnt=0;
	for(int i=0; i<n ;i++){
		if(mi[i]!=l) continue;
		if(R[i]>v) cnt++;
	}
	for(int i=0; i<n ;i++){
		if(mi[i]!=l) continue;
		if(R[i]>v) mi[i]=r-cnt+1;
		else ma[i]=r-cnt;
	}
	return cnt;
}
int minValue(int N, int W) {
    init();
    B[0]=1;
    playRound(B,R);
    for(int i=0; i<n ;i++) if(R[i]==0) return i;
}
int maxValue(int N, int W) {
	init();
    int l=1,r=n;
    while(l!=n){
    	l=r-play(l,r,f(l,r,W))+1;
	}
	for(int i=0; i<n ;i++) if(mi[i]==n) return i;
}

int greaterValue(int N, int W) {
    init();
    B[0]=B[1]=4;
    playRound(B,R);
    if(R[0]!=R[1]) return (R[0]==0);
    if(R[0]==0){
    	B[0]=B[1]=2;
	    playRound(B,R);
	    if(R[0]!=R[1]) return (R[0]==0);
	    B[0]=B[1]=1;
	    playRound(B,R);
	    if(R[0]!=R[1]) return (R[0]==0);
	}
	else{
		B[0]=B[1]=8;
	    playRound(B,R);
	    if(R[0]!=R[1]) return (R[0]==0);
	}
    return 0;
}
void solve(int l,int r){
	if(l==r) return;
	int num=play(l,r,f(l,r,100));
	solve(l,r-num);
	solve(r-num+1,r);
}
void allValues(int N, int W, int *P) {
	init();
    if (W == 2*N) {
        // TODO: Implement Subtask 4 solution here.
        // You may leave this block unmodified if you are not attempting this
        // subtask.
    } else {
        solve(1,n);
        for(int i=0; i<n ;i++) P[i]=mi[i];
    }
}

Compilation message

koala.cpp: In function 'int f(int, int, int)':
koala.cpp:25:25: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
    if(cv>val || cv>=val && best!=0){
                 ~~~~~~~~^~~~~~~~~~
koala.cpp: In function 'int minValue(int, int)':
koala.cpp:60:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
koala.cpp: In function 'int maxValue(int, int)':
koala.cpp:68:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 312 KB Output is correct
2 Correct 7 ms 492 KB Output is correct
3 Correct 8 ms 492 KB Output is correct
4 Correct 11 ms 492 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 564 KB Output is correct
2 Correct 22 ms 564 KB Output is correct
3 Correct 20 ms 664 KB Output is correct
4 Correct 17 ms 664 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 73 ms 784 KB Output is correct
2 Correct 105 ms 784 KB Output is correct
3 Correct 74 ms 792 KB Output is correct
4 Correct 86 ms 792 KB Output is correct
5 Correct 85 ms 792 KB Output is correct
6 Correct 77 ms 792 KB Output is correct
7 Correct 78 ms 792 KB Output is correct
8 Correct 82 ms 812 KB Output is correct
9 Correct 70 ms 812 KB Output is correct
10 Correct 86 ms 940 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 940 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
53.0 / 53.0

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