oj.uz

Submission #998406

# Submission time Handle Problem Language Result Execution time Memory
998406 2024-06-14T00:09:02 Z efishel Super Dango Maker (JOI22_dango3) C++17
2 / 100
 406 ms 600 KB 
//Logan/Dango
#include "dango3.h"
#include <bits/stdc++.h>
using namespace std;

void Solve(int N, int M){
    int valios[N*M+5],c=1,d;
    vector<int>r,rs[M];
    for(int i=1;i<=N*M;i++)
            valios[i]=0;
    for(int i=0;i<N;i++,c++){
        vector<int>valio=r;
        d=0;
        for(int j=1;j<=N*M;j++){
            if(valios[j]==0)valio.push_back(j);
            if(Query(valio)){
                rs[d].push_back(j);
                valios[j]=c;
                valio.pop_back();
                d++;
            }
        }
        for(int j=1;j<=N*M;j++)
            if(valios[j]==c)
                r.push_back(j);
        c++;
    }
    for(int i=0;i<M;i++)Answer(rs[i]);
}

Subtask #1
2.0 / 2.0

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

Subtask #2
0 / 5.0

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

Subtask #3
0 / 15.0

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

Subtask #4
0 / 78.0

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