# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
139278 | 2019-07-31T14:00:06 Z | PedroBigMan | 자동 인형 (IOI18_doll) | C++14 | 71 ms | 7480 KB |
#include "doll.h" #include <iostream> #include <vector> #include <cmath> #include <algorithm> #include <string> using namespace std; typedef int ll; typedef unsigned long long int ull; typedef long double ld; #define REP(i,a,b) for(ll i=a; i<b; i++) #define pb push_back #define mp make_pair #define pl pair<ll,ll> #define ff first #define ss second #define INF ((ll) pow(2,63) -1) ll insig; #define In(vecBRO, LENBRO) REP(IBRO,0,LENBRO) {cin>>insig; vecBRO.pb(insig);} void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;} void create_circuit(int M, std::vector<int> A) { vector<ll> fol; vector<pl> sw; vector<bool> visited; REP(i,0,M+1) {fol.pb(0);visited.pb(false);} fol[0]=A[0]; visited[0]=true; ll cur=0;ll N=A.size(); ll last=-1; REP(i,0,N) { cur = A[i]; if(!visited[cur]) { fol[cur]=0; if(i>=1) { if(last>=0) {fol[last]=cur;} else {sw[sw.size()-1].ss=cur;} } last=cur; } else if(last==cur) { sw.pb(mp(cur,0)); fol[cur]=-sw.size(); last=-sw.size(); } else { if(last>=0) {fol[last]=cur;} else {sw[sw.size()-1].ss=cur;} sw.pb(mp(fol[cur],0)); fol[cur]=-sw.size(); last=-sw.size(); } visited[cur]=true; } vector<ll> X,Y; REP(i,0,sw.size()) {X.pb(sw[i].ff); Y.pb(sw[i].ss);} answer(fol, X, Y); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 22 ms | 2044 KB | Output is correct |
3 | Correct | 17 ms | 1604 KB | Output is correct |
4 | Correct | 1 ms | 204 KB | Output is correct |
5 | Correct | 12 ms | 1604 KB | Output is correct |
6 | Correct | 27 ms | 2348 KB | Output is correct |
7 | Correct | 1 ms | 204 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 22 ms | 2044 KB | Output is correct |
3 | Correct | 17 ms | 1604 KB | Output is correct |
4 | Correct | 1 ms | 204 KB | Output is correct |
5 | Correct | 12 ms | 1604 KB | Output is correct |
6 | Correct | 27 ms | 2348 KB | Output is correct |
7 | Correct | 1 ms | 204 KB | Output is correct |
8 | Correct | 42 ms | 4260 KB | Output is correct |
9 | Correct | 41 ms | 3924 KB | Output is correct |
10 | Correct | 70 ms | 6480 KB | Output is correct |
11 | Correct | 1 ms | 204 KB | Output is correct |
12 | Correct | 2 ms | 204 KB | Output is correct |
13 | Correct | 2 ms | 204 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 22 ms | 2044 KB | Output is correct |
3 | Correct | 17 ms | 1604 KB | Output is correct |
4 | Correct | 1 ms | 204 KB | Output is correct |
5 | Correct | 12 ms | 1604 KB | Output is correct |
6 | Correct | 27 ms | 2348 KB | Output is correct |
7 | Correct | 1 ms | 204 KB | Output is correct |
8 | Correct | 42 ms | 4260 KB | Output is correct |
9 | Correct | 41 ms | 3924 KB | Output is correct |
10 | Correct | 70 ms | 6480 KB | Output is correct |
11 | Correct | 1 ms | 204 KB | Output is correct |
12 | Correct | 2 ms | 204 KB | Output is correct |
13 | Correct | 2 ms | 204 KB | Output is correct |
14 | Incorrect | 71 ms | 7480 KB | wrong motion |
15 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | wrong motion |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | wrong motion |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | wrong motion |
2 | Halted | 0 ms | 0 KB | - |