oj.uz

답안 #998430

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
998430 2024-06-14T01:38:42 Z efishel Super Dango Maker (JOI22_dango3) C++17
2 / 100
 23 ms 504 KB 
#include "dango3.h"
//Emmanuel B
//dango




#include <bits/stdc++.h>
using namespace std;
using lli=long long int;
#define pb push_back
#define deb(x) cout<<#x<<": "<<x<<endl;
#define deb2(x,y) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<endl;

void Solve(int N, int M) {
  vector<int> v (M);
  vector<bool> visited (N*M+5, false);
  for(int i=1; i<=N*M; ++i){
    if(visited[i]) continue;
    for(int j=i+1; j<=N*M; ++j){
      if(visited[j]) continue;
      for(int k=j+1; k<=N*M; ++k){
        if(visited[k]) continue;
        for(int l=k+1; l<=N*M; ++l){
          if(visited[l]) continue;
          if(visited[i]) continue;
          if(visited[j]) continue;
          if(visited[k]) continue;
          if(Query({i,j,k,l})){
         
            Answer({i,j,k,l});
            visited[i]=true;
            visited[j]=true;
            visited[k]=true;
            visited[l]=true;
          }
        }
      }
    }
  }
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 424 KB Output is correct
3 Correct 0 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

# 결과 실행 시간 메모리 Grader output
1 Incorrect 8 ms 348 KB Wrong Answer [3]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 14 ms 504 KB Wrong Answer [3]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 78.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 23 ms 344 KB Wrong Answer [3]
2 Halted 0 ms 0 KB -