oj.uz

답안 #978681

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
978681 2024-05-09T13:35:49 Z WongYiKai 코알라 (APIO17_koala) C++14
85 / 100
 92 ms 724 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 all2(int *P, int s, int e, vector<int> next){
    if (next.size()==1) {
        P[next[0]]=s;
        return;
    }
    int b[100],r[100];
    memset(b,0,sizeof(b));
    for (int i=1;i<=100;i++){
        for (auto item:next){
            b[item]=i;
        }
        playRound(b,r);
        vector<int> left,right;
        for (auto item:next){
            if (r[item]==0) left.push_back(item);
            else right.push_back(item);
        }
        // cout << "left: ";
        // for (auto item:left) cout << item << " ";
        // cout << "\nright: ";
        // for (auto item:right) cout << item << " ";
        // cout << "\n";
        if (left.empty()||right.empty()) continue;
        all2(P,s,left.size()+s-1,left);
        all2(P,left.size()+s,e,right);
        return;
    }

}
 
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.
        vector<int> next;
        for (int i=0;i<100;i++) next.push_back(i);
        all2(P,1,N,next);
    }
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 344 KB Output is correct
2 Correct 3 ms 344 KB Output is correct
3 Correct 5 ms 456 KB Output is correct
4 Correct 3 ms 456 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 452 KB Output is correct
2 Correct 10 ms 344 KB Output is correct
3 Correct 10 ms 344 KB Output is correct
4 Correct 10 ms 344 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 70 ms 724 KB Output is correct
2 Correct 73 ms 444 KB Output is correct
3 Correct 85 ms 460 KB Output is correct
4 Correct 66 ms 468 KB Output is correct
5 Correct 67 ms 460 KB Output is correct
6 Correct 92 ms 460 KB Output is correct
7 Correct 65 ms 476 KB Output is correct
8 Correct 66 ms 460 KB Output is correct
9 Correct 74 ms 472 KB Output is correct
10 Correct 76 ms 516 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 344 KB Output is correct
2 Correct 29 ms 452 KB Output is correct
3 Correct 29 ms 344 KB Output is correct
4 Correct 28 ms 592 KB Output is correct
5 Correct 30 ms 344 KB Output is correct
6 Correct 32 ms 596 KB Output is correct
7 Correct 27 ms 344 KB Output is correct
8 Correct 28 ms 344 KB Output is correct
9 Correct 27 ms 448 KB Output is correct
10 Correct 26 ms 452 KB Output is correct
11 Correct 28 ms 344 KB Output is correct
12 Correct 14 ms 452 KB Output is correct
13 Correct 27 ms 424 KB Output is correct
14 Correct 24 ms 344 KB Output is correct
15 Correct 25 ms 444 KB Output is correct
16 Correct 25 ms 596 KB Output is correct
17 Correct 25 ms 448 KB Output is correct
18 Correct 36 ms 344 KB Output is correct
19 Correct 27 ms 344 KB Output is correct
20 Correct 31 ms 344 KB Output is correct

Subtask #5
38.0 / 53.0

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