Submission #998431

#TimeUsernameProblemLanguageResultExecution timeMemory
998431efishelSuper Dango Maker (JOI22_dango3)C++17
2 / 100
23 ms348 KiB
#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; } } } } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...