Submission #245734


Source Code Expand

#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>

#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)

using namespace std;
typedef long long int ll;
const double EPS=1e-9;

const int N=10010;

int n;
int r[N];

vector<int> pile[3];

void mv(int a,int b) {
	cout << a << " " << b << endl;
	int t = pile[a-1].back();
	pile[a-1].pop_back();
	pile[b-1].push_back(t);
}
int top(int a) {
	return pile[a-1].back();
}

void qs(int st,int en,int from, int d) {
	if(en <= st) {
		return;
	}
	int piv = (st + en + 1) / 2;
	int d1 = from % 3 + 1;
	int d2 = (from + 1) % 3 + 1;
	REP(c,st,en+1) {
		int t = top(from);
		if(t >= piv) {
			mv(from, d2);
		} else {
			mv(from, d1);
		}
	}
	qs(st,piv-1,d1,1-d);
	qs(piv,en,d2,1-d);
	if(d) {
		REP(i,piv,en+1) mv(d2,from);
		REP(i,st, piv) mv(d1, from);
	} else {
		REP(i,st,piv) mv(d1,from);
		REP(i,piv,en+1) mv(d2,from);
	}
}

int main(void){
	cin>>n;
	REP(i,0,n) {
		cin>>r[i];
		pile[0].push_back(r[i]);
	}
	qs(1,n,1,0);
}

Submission Info

Submission Time
Task G - ノイハの塔
User kobae964
Language C++ (G++ 4.6.4)
Score 0
Code Size 1162 Byte
Status WA
Exec Time 834 ms
Memory 1340 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 0 / 30 0 / 70
Status
WA × 2
WA × 21
WA × 40
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
Subtask1 sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt
Subtask2 sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt
Case Name Status Exec Time Memory
sample_01.txt WA 35 ms 1112 KB
sample_02.txt WA 28 ms 1056 KB
subtask1_01.txt WA 29 ms 1056 KB
subtask1_02.txt WA 42 ms 1100 KB
subtask1_03.txt WA 35 ms 1108 KB
subtask1_04.txt WA 36 ms 1148 KB
subtask1_05.txt WA 39 ms 1128 KB
subtask1_06.txt WA 46 ms 1112 KB
subtask1_07.txt WA 45 ms 1152 KB
subtask1_08.txt WA 33 ms 1052 KB
subtask1_09.txt WA 45 ms 1152 KB
subtask1_10.txt WA 48 ms 1056 KB
subtask1_11.txt WA 47 ms 1048 KB
subtask1_12.txt WA 48 ms 1148 KB
subtask1_13.txt WA 47 ms 1152 KB
subtask1_14.txt WA 46 ms 1112 KB
subtask1_15.txt WA 49 ms 1112 KB
subtask1_16.txt WA 47 ms 1044 KB
subtask1_17.txt WA 48 ms 1028 KB
subtask1_18.txt WA 50 ms 1056 KB
subtask1_19.txt WA 47 ms 1172 KB
subtask2_01.txt WA 254 ms 1180 KB
subtask2_02.txt WA 154 ms 1260 KB
subtask2_03.txt WA 170 ms 1264 KB
subtask2_04.txt WA 509 ms 1204 KB
subtask2_05.txt WA 695 ms 1276 KB
subtask2_06.txt WA 700 ms 1300 KB
subtask2_07.txt WA 704 ms 1324 KB
subtask2_08.txt WA 690 ms 1300 KB
subtask2_09.txt WA 708 ms 1308 KB
subtask2_10.txt WA 695 ms 1328 KB
subtask2_11.txt WA 834 ms 1288 KB
subtask2_12.txt WA 691 ms 1340 KB
subtask2_13.txt WA 749 ms 1328 KB
subtask2_14.txt WA 683 ms 1328 KB
subtask2_15.txt WA 697 ms 1332 KB
subtask2_16.txt WA 694 ms 1336 KB
subtask2_17.txt WA 700 ms 1296 KB
subtask2_18.txt WA 698 ms 1280 KB
subtask2_19.txt WA 720 ms 1296 KB