oj.uz

Submission #596786

# Submission time Handle Problem Language Result Execution time Memory
596786 2022-07-15T04:58:40 Z 반딧불(#8447) Super Dango Maker (JOI22_dango3) C++17
7 / 100
 1230 ms 540 KB 
#include "dango3.h"
#include <bits/stdc++.h>

using namespace std;

namespace {
    int n, m;
    bool used[10002];
}

void Solve(int N, int M){
    n = N, m = M;
    for(int turn=1; turn<=m; turn++){
        vector<int> vec;
        for(int i=1; i<=n*m; i++) if(!used[i]) vec.push_back(i);
        for(int i=1; i<=n*m; i++){
            if(used[i]) continue;
            vector<int> tmp = vec;
            tmp.erase(find(tmp.begin(), tmp.end(), i));
            if(Query(tmp)) vec = tmp;
        }
        Answer(vec);
        for(auto x: vec) used[x] = 1;
    }
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 340 KB Output is correct
2 Correct 13 ms 396 KB Output is correct
3 Correct 14 ms 400 KB Output is correct
4 Correct 14 ms 408 KB Output is correct
5 Correct 13 ms 340 KB Output is correct
6 Correct 13 ms 340 KB Output is correct

Subtask #3
0 / 15.0

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

Subtask #4
0 / 78.0

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