oj.uz

Submission #978391

# Submission time Handle Problem Language Result Execution time Memory
978391 2024-05-09T07:47:07 Z WongYiKai Koala Game (APIO17_koala) C++14
37 / 100
 84 ms 756 KB 
#include "koala.h"
#include <bits/stdc++.h>
using namespace std;
 
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.
    int b[N],r[N];
    for (int i=0;i<N;i++){
        b[i] = 0;
    }
    b[0] = 1;
    playRound(b,r);
    for (int i=0;i<100;i++){
        if (r[i]==0) return i;
    }
    return 0;
}
 
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.
    int b[N],r[N];
    for (int i=0;i<N;i++){
        b[i] = 1;
    }
    //b[0] = 1;
    playRound(b,r);
    queue<int> next;
    for (int i=0;i<N;i++){
        if (r[i]==2) next.push(i);
    }
    for (int i=0;i<N;i++){
        b[i] = 0;
    }
    while (!next.empty()) {
        b[next.front()]=2;
        next.pop();
    }
    playRound(b,r);
    for (int i=0;i<N;i++){
        if (r[i]==3) next.push(i);
    }
    for (int i=0;i<N;i++){
        b[i] = 0;
    }
    while (!next.empty()) {
        b[next.front()]=4;
        next.pop();
    }
    playRound(b,r);
    for (int i=0;i<N;i++){
        if (r[i]==5) next.push(i);
    }
    for (int i=0;i<N;i++){
        b[i] = 0;
    }
    while (!next.empty()) {
        b[next.front()]=11;
        next.pop();
    }
    playRound(b,r);
    for (int i=0;i<N;i++){
        if (r[i]==12) return i;
    }
    return 0;
}
 
int compare(int a, int bb){
	int N=100;
	int b[N],r[N];
    for (int i=0;i<N;i++){
        b[i] = 1;
    }
    //b[0] = 1;
    playRound(b,r);
    queue<int> next;
    int grp[100];
    vector<int> grps[5];
    for (int i=0;i<N;i++){
        if (r[i]==2) next.push(i);
        if (r[i]==2){
			grp[i]=3;
		}
		else grp[i]=1;
    }
    for (int i=0;i<N;i++){
        b[i] = 0;
    }
    while (!next.empty()) {
        b[next.front()]=2;
        next.pop();
    }
    playRound(b,r);
    for (int i=0;i<N;i++){
        if (r[i]==3) next.push(i);
        if (r[i]==3) grp[i] = 4;
        else if (r[i]==1) grp[i] = 2;
    }
    for (int i=0;i<N;i++){
		grps[grp[i]].push_back(i);
	}
	
	if (grp[a]>grp[bb]) return a;
	else if (grp[a]<grp[bb]) return bb;
	
    for (int i=0;i<N;i++){
        b[i] = 0;
    }
	if (grp[a]==2){
		b[a]=6;
		b[bb]=6;
	}
	else if (grp[a]==3){
		b[a]=8;
		b[bb]=8;
	}
	else if (grp[a]==4){
		b[a]=10;
		b[bb]=10;
	}
	else{
		for (int i=0;i<N;i++){
			b[i] = 1;
		}
		b[a]=0;
		b[bb]=0;
		b[grps[4][0]]=0;
	}
	
	playRound(b,r);
	if (r[a]!=0) return a;
	else return bb;
}
	
 
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.
    return compare(0,1);
}
 
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 {
        // TODO: Implement Subtask 5 solution here.
        // You may leave this block unmodified if you are not attempting this
        // subtask.
    }
}

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 6 ms 452 KB Output is correct
4 Correct 5 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 11 ms 344 KB Output is correct
3 Correct 11 ms 344 KB Output is correct
4 Correct 10 ms 756 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 500 KB Output is correct
2 Correct 71 ms 456 KB Output is correct
3 Correct 69 ms 476 KB Output is correct
4 Correct 67 ms 724 KB Output is correct
5 Correct 67 ms 456 KB Output is correct
6 Correct 65 ms 464 KB Output is correct
7 Correct 65 ms 460 KB Output is correct
8 Correct 69 ms 464 KB Output is correct
9 Correct 72 ms 460 KB Output is correct
10 Correct 65 ms 468 KB Output is correct

Subtask #4
0 / 10.0

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

Subtask #5
0 / 53.0

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