oj.uz

Submission #971683

# Submission time Handle Problem Language Result Execution time Memory
971683 2024-04-29T07:47:02 Z 12345678 Super Dango Maker (JOI22_dango3) C++17
7 / 100
 2094 ms 700 KB 
#include "dango3.h"
#include <bits/stdc++.h>

using namespace std;

const int nx=1e4+5;

int used[nx], n, m;

int query()
{
    vector<int> qrs;
    for (int i=1; i<=n*m; i++) if (!used[i]) qrs.push_back(i);
    return Query(qrs);
}

void Solve(int N, int M) {
    n=N, m=M;
    for (int i=M; i>=1; i--)
    {
        vector<int> res;
        for (int j=1; j<=N*M; j++)
        {
            if (used[j]) continue;
            used[j]=1;
            if (query()==i-1) res.push_back(j);
            else used[j]=0;
        }
        Answer(res);
    }
}

Subtask #1
2.0 / 2.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 512 KB Output is correct
2 Correct 22 ms 348 KB Output is correct
3 Correct 25 ms 516 KB Output is correct
4 Correct 27 ms 348 KB Output is correct
5 Correct 22 ms 348 KB Output is correct
6 Correct 22 ms 348 KB Output is correct

Subtask #3
0 / 15.0

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

Subtask #4
0 / 78.0

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