# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1020643 | 2024-07-12T07:59:48 Z | Unforgettablepl | Super Dango Maker (JOI22_dango3) | C++17 | 418 ms | 620 KB |
#include "dango3.h" #include <bits/stdc++.h> using namespace std; namespace { const int SQRT = 5; } // namespace void Solve(int N, int M) { vector<int> idxes(N*M+1);iota(idxes.begin(),idxes.end(),0); for(int round=0;round<M;round++){ vector<int> ans; for(int included=N*(M-round);included;included-=SQRT){ vector<int> query; for(int i=1;i<=(included-SQRT);i++)query.emplace_back(idxes[i]); int q = 0; if(!query.empty()){ for(int&i:ans)query.emplace_back(i); q = Query(query); } if(q>=1)continue; for(int inc=included;inc>included-SQRT;inc--){ vector<int> query; for(int i=1;i<inc;i++)query.emplace_back(idxes[i]); int q = 0; if(!query.empty()){ for(int&i:ans)query.emplace_back(i); q = Query(query); } if(q>=1)continue; ans.emplace_back(idxes[inc]); idxes.erase(idxes.begin()+inc); if(ans.size()==N)break; } if(ans.size()==N)break; } Answer(ans); } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 440 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 | 380 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 348 KB | Output is correct |
2 | Correct | 3 ms | 348 KB | Output is correct |
3 | Correct | 9 ms | 512 KB | Output is correct |
4 | Correct | 8 ms | 348 KB | Output is correct |
5 | Correct | 2 ms | 504 KB | Output is correct |
6 | Correct | 2 ms | 348 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 95 ms | 588 KB | Output is correct |
2 | Correct | 99 ms | 600 KB | Output is correct |
3 | Correct | 188 ms | 620 KB | Output is correct |
4 | Correct | 181 ms | 600 KB | Output is correct |
5 | Correct | 81 ms | 600 KB | Output is correct |
6 | Correct | 83 ms | 600 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 418 ms | 600 KB | Wrong Answer [3] |
2 | Halted | 0 ms | 0 KB | - |