oj.uz

Submission #978674

# Submission time Handle Problem Language Result Execution time Memory
978674 2024-05-09T13:14:53 Z WongYiKai Koala Game (APIO17_koala) C++14
47 / 100
 72 ms 596 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 all1(int *P){
    int b[100],r[100],a[100];
    for (int i=0;i<100;i++) a[i] = i;
    stable_sort(a,a+100,[&](int aa,int bb){
        memset(b,0,sizeof(b));
        b[aa]=100;
        b[bb]=100;
        playRound(b,r);
        if (r[aa]==0) return true;
        return false;
    });

    for (int i=0;i<100;i++){
        P[a[i]]=i+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.
        all1(P);
    } 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 4 ms 344 KB Output is correct
2 Correct 3 ms 344 KB Output is correct
3 Correct 3 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 11 ms 456 KB Output is correct
2 Correct 10 ms 344 KB Output is correct
3 Correct 10 ms 456 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 63 ms 468 KB Output is correct
2 Correct 70 ms 460 KB Output is correct
3 Correct 66 ms 456 KB Output is correct
4 Correct 65 ms 472 KB Output is correct
5 Correct 64 ms 464 KB Output is correct
6 Correct 63 ms 472 KB Output is correct
7 Correct 72 ms 472 KB Output is correct
8 Correct 64 ms 460 KB Output is correct
9 Correct 66 ms 472 KB Output is correct
10 Correct 64 ms 456 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
0 / 53.0

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