# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
892542 | 2023-12-25T13:28:35 Z | Aiperiii | Super Dango Maker (JOI22_dango3) | C++17 | 543 ms | 856 KB |
#include "dango3.h" #include <bits/stdc++.h> using namespace std; void Solve(int n,int m){ queue < pair < vector <int> ,int > > q; vector <int> in; vector <vector <int> > ans; for(int i=1;i<=n*m;i++){ in.push_back(i); } q.push({in,m}); while(!q.empty()){ vector <int> v=q.front().first; int k=q.front().second; q.pop(); if(k<=1){ ans.push_back(v); } else{ vector <int> used(v.size()); for(int i=0;i<v.size();i++){ used[i]=1; vector <int> x; for(int j=0;j<v.size();j++){ if(used[j]==0)x.push_back(v[j]); } if(Query(x)<k/2)used[i]=0; } vector <int> g1,g2; for(int i=0;i<v.size();i++){ if(used[i]==0)g1.push_back(v[i]); else g2.push_back(v[i]); } q.push({g1,k/2}); if(k%2==1)q.push({g2,k/2+1}); else q.push({g2,k/2}); } } for(auto x : ans){ Answer(x); } return; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 600 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 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 348 KB | Output is correct |
2 | Correct | 5 ms | 348 KB | Output is correct |
3 | Correct | 6 ms | 524 KB | Output is correct |
4 | Correct | 7 ms | 348 KB | Output is correct |
5 | Correct | 5 ms | 348 KB | Output is correct |
6 | Correct | 5 ms | 348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 114 ms | 612 KB | Output is correct |
2 | Correct | 116 ms | 604 KB | Output is correct |
3 | Correct | 146 ms | 616 KB | Output is correct |
4 | Correct | 133 ms | 600 KB | Output is correct |
5 | Correct | 117 ms | 856 KB | Output is correct |
6 | Correct | 110 ms | 612 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 450 ms | 604 KB | Output is correct |
2 | Correct | 459 ms | 604 KB | Output is correct |
3 | Correct | 543 ms | 604 KB | Output is correct |
4 | Correct | 510 ms | 604 KB | Output is correct |
5 | Correct | 427 ms | 832 KB | Output is correct |
6 | Correct | 428 ms | 740 KB | Output is correct |