답안 #998415

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
998415 2024-06-14T00:15:22 Z efishel Super Dango Maker (JOI22_dango3) C++17
7 / 100
427 ms 604 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(N<=valio.size())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]);
}

Compilation message

dango3.cpp: In function 'void Solve(int, int)':
dango3.cpp:17:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |                 if(N<=valio.size())if(Query(valio)){
      |                    ~^~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 348 KB Output is correct
2 Correct 52 ms 348 KB Output is correct
3 Correct 59 ms 600 KB Output is correct
4 Correct 59 ms 508 KB Output is correct
5 Correct 58 ms 348 KB Output is correct
6 Correct 63 ms 516 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Incorrect 218 ms 604 KB Wrong Answer [3]
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 427 ms 600 KB Wrong Answer [3]
2 Halted 0 ms 0 KB -