# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1028783 | 2024-07-20T08:37:57 Z | Mardonbekhazratov | 드문 곤충 (IOI22_insects) | C++17 | 1 ms | 344 KB |
#include "insects.h" #include <vector> #include <set> using namespace std; int min_cardinality(int N){ set<int>s; vector<int>l; for(int i=0;i<N;i++){ move_inside(i); l.push_back(i); if(press_button()>1){ move_outside(i); s.insert(i); l.pop_back(); } } int ans=1,last=l.size(); while(l.size()>0){ move_outside(l.back()); l.pop_back(); } while(true){ set<int>new_s; for(int x:s){ if(l.size()==last) break; move_inside(x); l.push_back(x); if(press_button()>1){ move_outside(x); new_s.insert(x); l.pop_back(); } } if(l.size()!=last){ return ans; } while(l.size()>0){ move_outside(l.back()); l.pop_back(); } swap(new_s,s); ans++; } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Correct | 0 ms | 344 KB | Output is correct |
4 | Correct | 0 ms | 344 KB | Output is correct |
5 | Correct | 0 ms | 344 KB | Output is correct |
6 | Incorrect | 1 ms | 344 KB | Wrong answer. |
7 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Correct | 0 ms | 344 KB | Output is correct |
4 | Correct | 0 ms | 344 KB | Output is correct |
5 | Correct | 0 ms | 344 KB | Output is correct |
6 | Incorrect | 1 ms | 344 KB | Wrong answer. |
7 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Correct | 0 ms | 344 KB | Output is correct |
4 | Correct | 0 ms | 344 KB | Output is correct |
5 | Correct | 0 ms | 344 KB | Output is correct |
6 | Incorrect | 0 ms | 344 KB | Wrong answer. |
7 | Halted | 0 ms | 0 KB | - |