QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#402781	#677. Koala Game	Max_s_xaM	37	35ms	4076kb	C++14	2.3kb	2024-05-01 14:19:13	2024-05-01 14:19:14

Judging History

This is the latest submission verdict.

[2024-05-01 14:19:14]
Judged

Verdict: 37
Time: 35ms
Memory: 4076kb

Show

[2024-05-01 14:19:13]
Submitted

answer

#include "koala.h"
#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

int n, w;

int B[110], R[110];
inline vector <int> Query(vector <int> qry)
{
    // cout << "Query ";
    // for (int i = 0; i < n; i++) cout << qry[i] << ' '; cout << '\n';
    for (int i = 0; i < n; i++) B[i] = qry[i];
    playRound(B, R);
    vector <int> ret(n);
    for (int i = 0; i < n; i++) ret[i] = R[i];
    return ret;
}
inline vector <int> GetPos(vector <int> opt, vector <int> ret, int x)
{
    vector <int> pos;
    for (int i = 0; i < n; i++)
        if (opt[i] < ret[i] && opt[i] == x) pos.push_back(i);
    return pos;
}

vector <int> opt(100), ret(100), pos;


int minValue(int N, int W)
{
    n = N, w = W;
    opt[0] = 1, ret = Query(opt);
    if (ret[0] < 2) return 0;
    for (int i = 0; i < n; i++)
        if (!ret[i]) return i;
}

int maxValue(int N, int W)
{
    n = N, w = W;

    for (int i = 0; i < n; i++) opt[i] = 1;
    ret = Query(opt), pos = GetPos(opt, ret, 1);

    for (int i = 0; i < n; i++) opt[i] = 0;
    for (auto x : pos) opt[x] = 2;
    ret = Query(opt), pos = GetPos(opt, ret, 2);
    
    for (int i = 0; i < n; i++) opt[i] = 0;
    for (auto x : pos) opt[x] = 4;
    ret = Query(opt), pos = GetPos(opt, ret, 4);

    for (int i = 0; i < n; i++) opt[i] = 0;
    for (auto x : pos) opt[x] = 11;
    ret = Query(opt), pos = GetPos(opt, ret, 11);

    return pos[0];
}

const int gV[7] = {1, 2, 4, 5, 6, 7, 8};
int greaterValue(int N, int W)
{
    n = N, w = W;
    int l = 0, r = 6, mid;
    while (l <= r)
    {
        mid = l + r >> 1;
        opt[0] = gV[mid], opt[1] = gV[mid];
        ret = Query(opt);
        bool flag = (ret[0] > opt[0]) ^ (ret[1] > opt[1]);
        if (flag) return (ret[1] > opt[1]);
        if (ret[0] > opt[0]) l = mid + 1;
        else r = mid - 1;
    }
    return 0;
}

void allValues(int N, int W, int *P)
{
    n = N, w = W;
    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.
    }
}

源文件, 语言: C++14

详细

Subtask #1:

score: 4

Accepted

Test #1:

score: 4

Accepted

time: 3ms

memory: 3764kb

input:

1 100 2
100 100 46 17 44 52 18 67 69 100 62 96 33 64 41 47 87 54 99 32 14 4 89 73 70 20 81 42 8 80 65 88 36 11 53 98 56 94 79 57 1 76 31 7 72 13 21 92 86 66 90 24 40 75 68 15 37 25 43 58 60 3 82 85 28 16 71 97 22 38 9 39 48 78 74 91 50 35 29 27 10 12 6 19 5 34 95 59 93 83 30 49 51 61 26 23 77 55 45 ...

output:

result:

points 1.0 number of queries is 1

Test #2:

score: 4

Accepted

time: 3ms

memory: 3692kb

input:

1 100 2
100 100 68 30 61 13 87 15 18 63 49 73 82 57 19 45 40 92 48 41 97 31 44 8 71 77 35 65 95 28 6 94 74 7 53 46 81 88 3 91 72 62 36 50 12 21 54 26 24 2 47 80 39 4 55 27 51 70 96 34 89 75 16 29 58 9 98 99 83 33 42 32 11 69 14 5 66 86 100 22 67 38 52 79 59 93 60 56 20 25 76 43 84 90 78 37 1 17 10 2...

output:

result:

points 1.0 number of queries is 1

Test #3:

score: 4

Accepted

time: 3ms

memory: 3748kb

input:

1 100 2
100 100 73 64 94 19 67 57 90 6 97 12 15 18 32 95 5 55 76 36 25 75 59 74 49 83 20 99 8 70 33 14 39 10 23 53 79 58 46 47 29 44 88 87 9 1 82 71 38 37 86 51 13 42 93 43 78 30 54 4 98 91 48 62 72 68 56 96 31 17 24 2 35 21 77 81 41 52 69 61 11 84 89 92 50 100 45 22 28 66 65 26 80 27 40 16 60 85 3 ...

output:

result:

points 1.0 number of queries is 1

Test #4:

score: 4

Accepted

time: 3ms

memory: 3724kb

input:

1 99 2
100 100 53 64 41 55 63 58 60 56 44 57 61 46 54 49 45 59 47 42 43 40 48 62 50 51 52 36 38 39 33 32 37 34 35 92 91 95 93 94 98 96 97 90 66 68 70 69 67 65 11 12 8 10 9 30 29 31 100 99 6 2 4 7 1 5 3 17 14 13 18 15 19 16 79 84 75 77 85 78 88 72 89 73 87 74 83 86 76 81 71 80 82 25 21 23 24 26 22 28...

output:

result:

points 1.0 number of queries is 1

Subtask #2:

score: 15

Accepted

Test #5:

score: 15

Accepted

time: 5ms

memory: 3828kb

input:

2 100 13
100 100 65 36 67 86 38 76 15 17 13 93 83 57 46 90 14 2 52 88 29 74 55 66 79 75 37 81 87 47 56 25 33 39 8 31 64 73 98 78 100 94 10 58 61 70 53 54 21 49 16 5 4 85 44 62 27 92 91 26 72 41 42 99 89 77 12 69 60 24 3 30 40 1 84 68 59 28 11 71 96 97 63 32 18 34 43 82 48 35 95 80 7 45 19 23 51 22 5...

output:

result:

points 1.0 number of queries is 4

Test #6:

score: 15

Accepted

time: 8ms

memory: 3760kb

input:

2 100 13
100 100 86 98 14 10 46 93 8 40 9 61 74 35 76 6 53 50 44 88 43 42 84 57 79 39 58 13 28 77 83 16 34 49 71 45 20 64 18 68 24 15 26 38 72 85 82 21 75 52 23 100 37 36 99 12 62 4 33 11 27 81 95 2 70 65 87 30 56 90 48 66 25 41 51 3 92 63 60 80 7 22 19 89 29 94 97 32 31 59 96 91 78 69 5 55 73 67 17...

output:

result:

points 1.0 number of queries is 4

Test #7:

score: 15

Accepted

time: 8ms

memory: 4040kb

input:

2 100 13
100 100 86 7 41 38 96 16 6 65 92 85 88 13 80 64 45 37 34 14 44 12 78 66 79 10 3 69 43 91 97 22 11 1 26 56 81 59 39 94 40 9 15 90 48 20 74 68 55 29 2 23 46 93 24 35 95 72 82 31 100 71 52 60 87 89 75 8 57 28 33 63 21 62 84 25 58 47 30 42 61 19 54 17 27 5 36 99 49 51 18 4 98 50 77 76 73 32 83 ...

output:

result:

points 1.0 number of queries is 4

Test #8:

score: 15

Accepted

time: 8ms

memory: 3740kb

input:

2 99 13
100 100 64 61 58 62 76 63 68 57 69 66 70 77 67 73 75 60 74 71 72 59 65 3 2 1 50 54 41 46 45 35 55 33 39 44 53 52 40 51 38 56 49 34 37 31 36 42 48 47 43 32 84 98 86 87 99 80 78 100 89 95 93 83 96 92 85 91 97 94 88 90 79 81 82 20 10 9 16 11 17 19 4 7 18 12 13 22 27 8 6 24 29 28 23 15 26 30 25 ...

output:

result:

points 1.0 number of queries is 4

Subtask #3:

score: 18

Accepted

Test #9:

score: 18

Accepted

time: 30ms

memory: 3768kb

input:

3 1100 14
100 100 50 78 94 90 6 24 52 93 73 4 7 5 40 2 17 41 27 8 21 16 64 80 96 12 46 57 38 22 69 92 47 10 60 13 76 62 30 74 31 82 91 32 36 53 84 98 44 77 19 49 83 71 79 15 87 37 20 85 48 51 68 55 3 81 1 34 99 97 26 9 75 35 28 56 33 65 54 25 18 66 11 63 43 61 88 45 89 23 39 29 100 58 67 95 42 59 72...

output:

result:

points 1.0 number of queries is 3

Test #10:

score: 18

Accepted

time: 35ms

memory: 3768kb

input:

3 999 14
100 100 5 6 45 48 46 44 47 4 2 1 3 39 34 42 37 38 35 43 41 40 36 30 33 32 31 13 8 17 7 11 9 12 23 19 18 10 24 20 26 16 22 14 15 21 25 55 76 49 52 63 62 50 70 66 56 73 53 58 77 75 74 60 72 57 67 68 59 64 61 69 54 65 51 71 28 29 27 94 96 93 92 100 91 97 98 95 99 78 89 88 84 86 79 81 85 83 90 ...

output:

result:

points 1.0 number of queries is 3

Test #11:

score: 18

Accepted

time: 29ms

memory: 4060kb

input:

3 1100 14
100 100 5 19 35 90 87 82 29 71 99 14 70 15 74 62 79 30 40 68 13 88 2 94 45 4 46 80 92 66 100 98 33 34 39 37 60 59 48 31 28 43 56 57 93 55 95 27 84 11 49 8 63 47 65 41 26 44 12 3 72 17 50 75 86 10 85 36 7 73 81 18 21 64 91 16 53 9 23 78 58 1 97 25 24 38 69 51 42 32 67 77 61 22 96 89 76 6 52...

output:

result:

points 1.0 number of queries is 3

Test #12:

score: 18

Accepted

time: 29ms

memory: 4060kb

input:

3 1100 14
100 100 68 13 93 8 76 73 14 27 33 9 78 55 84 66 4 7 98 75 70 81 52 71 34 79 83 12 74 30 23 56 99 58 54 21 46 39 31 41 26 11 65 40 35 96 42 5 6 94 91 22 63 100 95 45 48 87 37 86 38 24 19 44 32 18 67 15 80 51 89 47 10 64 49 59 20 17 29 69 92 25 88 36 1 43 28 90 61 3 2 97 85 16 50 60 57 53 82...

output:

result:

points 1.0 number of queries is 3

Test #13:

score: 18

Accepted

time: 30ms

memory: 4072kb

input:

3 1100 14
100 100 96 31 21 50 24 87 17 85 86 42 51 58 75 77 92 81 97 7 82 20 3 29 65 34 98 16 95 73 48 4 10 40 22 28 63 41 13 15 76 30 32 71 47 84 27 52 68 69 25 43 35 70 80 93 74 12 64 6 89 9 37 49 1 2 14 60 11 19 72 45 59 67 23 57 62 55 78 79 61 100 56 66 18 8 53 54 94 38 44 5 36 99 88 33 26 83 46...

output:

result:

points 1.0 number of queries is 3

Test #14:

score: 18

Accepted

time: 26ms

memory: 4076kb

input:

3 1100 14
100 100 61 99 28 21 69 44 87 57 84 52 68 82 11 22 94 75 8 43 33 58 81 88 50 16 20 100 47 15 86 23 39 67 56 60 19 26 76 35 12 73 89 38 78 4 55 36 30 48 80 10 9 24 34 91 13 27 98 65 41 97 59 95 37 40 46 63 83 79 42 90 74 62 45 96 70 71 93 1 2 72 14 5 3 77 49 7 29 64 25 6 54 53 18 17 31 92 32...

output:

result:

points 1.0 number of queries is 3

Test #15:

score: 18

Accepted

time: 29ms

memory: 3820kb

input:

3 1100 14
100 100 90 81 30 56 19 16 57 69 28 43 85 87 99 91 79 11 39 32 23 5 33 55 86 96 41 20 38 70 22 37 27 53 2 52 31 58 75 26 44 35 8 49 100 65 24 72 42 71 68 94 3 34 9 98 92 64 63 13 76 73 18 36 21 4 66 7 17 83 67 48 84 59 12 51 40 88 15 78 1 45 14 97 80 29 50 77 93 10 54 89 62 25 47 82 46 95 7...

output:

result:

points 1.0 number of queries is 3

Test #16:

score: 18

Accepted

time: 26ms

memory: 3740kb

input:

3 1100 14
100 100 20 40 92 95 76 27 8 16 23 54 65 68 81 17 94 48 5 60 28 84 49 37 3 98 90 10 64 24 51 39 1 25 32 87 83 9 89 67 72 7 80 13 42 34 21 29 12 73 6 46 66 18 91 53 55 61 74 88 36 57 4 70 69 50 58 26 82 35 78 79 56 30 43 75 14 15 77 62 19 71 11 93 100 2 97 45 96 41 44 52 86 22 85 31 59 33 38...

output:

result:

points 1.0 number of queries is 3

Test #17:

score: 18

Accepted

time: 30ms

memory: 3740kb

input:

3 1100 14
100 100 66 6 98 27 77 4 11 1 28 59 40 61 85 81 50 21 51 78 65 73 62 76 72 71 7 5 57 14 41 94 86 17 96 84 19 24 47 48 37 3 52 95 79 45 46 8 70 58 90 83 91 12 87 97 55 69 15 31 67 74 53 30 64 2 54 33 42 35 89 80 13 92 63 10 16 99 75 68 20 44 23 93 100 29 32 34 25 43 49 9 88 18 38 36 60 82 22...

output:

result:

points 1.0 number of queries is 3

Test #18:

score: 18

Accepted

time: 25ms

memory: 3812kb

input:

3 1100 14
100 100 54 92 42 36 93 13 55 65 66 85 60 50 61 63 35 47 51 52 20 31 72 46 26 70 16 17 15 82 4 53 91 80 14 25 62 48 43 41 37 97 24 68 39 19 9 86 76 21 83 73 38 90 78 96 32 5 3 79 58 87 71 74 8 69 2 40 28 75 88 33 64 67 49 44 100 95 27 84 6 23 81 57 98 45 59 7 56 18 89 30 22 29 34 12 11 99 1...

output:

result:

points 1.0 number of queries is 3

Subtask #4:

score: 0

Wrong Answer

Test #19:

score: 0

Wrong Answer

time: 1ms

memory: 3980kb

input:

4 1 700
100 200 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98...

output:

-1

result:

wrong answer

Subtask #5:

score: 0

Wrong Answer

Test #39:

score: 0

Wrong Answer

time: 1ms

memory: 3736kb

input:

4 1 3200
100 100 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 9...

output:

-1

result:

wrong answer