oj.uz

Submission #608759

# Submission time Handle Problem Language Result Execution time Memory
608759 2022-07-27T09:55:08 Z DeMen100ns Monster Game (JOI21_monster) C++17
0 / 100
 177 ms 296 KB 
/*
Author : DeMen100ns (a.k.a Vo Khac Trieu)
School : VNU-HCM High school for the Gifted
fuck you adhoc
*/

#include <monster.h>

namespace {
	const int N = 1005;
  
    bool f[N][N];
    int cnt[N];

};

std::vector<int> Solve(int n)
{
    for(int i = 0; i < n; ++i){
        for(int j = i + 1; j < n; ++j){
            f[i][j] = Query(i, j);
            cnt[i] += f[i][j];
            cnt[j] += (!f[i][j]);
        }
    }
    std::vector <int> ans(N);
    int luu1 = -1, luu2 = -1;
    for(int i = 0; i < n; ++i){
        if (cnt[i] < n - 1){
            ans[i] = cnt[i] - 1;
        } else{
            if (luu1 == -1) luu1 = i;
            else luu2 = i;
        }
    }
    ans[luu1] = ans[luu2] = n - 1;
    if (f[luu1][luu2]) ans[luu1] = n - 2;
    else ans[luu2] = n - 2;

    return ans;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

# Verdict Execution time Memory Grader output
1 Incorrect 177 ms 296 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -