oj.uz

Submission #988540

# Submission time Handle Problem Language Result Execution time Memory
988540 2024-05-25T06:31:29 Z toan2602 Super Dango Maker (JOI22_dango3) C++17
0 / 100
 78 ms 612 KB 
#include<bits/stdc++.h>
#include "dango3.h"

using namespace std;

vector<int> ans, v2, x;

void Solve(int n, int m) {

    for (int i = n * m; i >= 1; i--) x.push_back(i);
    v2 = x;
    while(!x.empty()) {
        int cur = x.back();
        x.pop_back();
        v2 = x;
        for (int i: ans) v2.push_back(i);
        if(Query(v2) == 0) {
            ans.push_back(cur);
        }
    }
    Answer(ans);
}

Subtask #1
0 / 2.0

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

Subtask #2
0 / 5.0

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

Subtask #3
0 / 15.0

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

Subtask #4
0 / 78.0

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