Submission #245735


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 1163 Byte
Status WA
Exec Time 842 ms
Memory 1120 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 40 ms 932 KB
sample_02.txt WA 24 ms 936 KB
subtask1_01.txt WA 26 ms 972 KB
subtask1_02.txt WA 38 ms 916 KB
subtask1_03.txt WA 28 ms 928 KB
subtask1_04.txt WA 31 ms 856 KB
subtask1_05.txt WA 32 ms 828 KB
subtask1_06.txt WA 37 ms 924 KB
subtask1_07.txt WA 42 ms 932 KB
subtask1_08.txt WA 30 ms 932 KB
subtask1_09.txt WA 37 ms 804 KB
subtask1_10.txt WA 42 ms 924 KB
subtask1_11.txt WA 44 ms 932 KB
subtask1_12.txt WA 47 ms 936 KB
subtask1_13.txt WA 42 ms 928 KB
subtask1_14.txt WA 42 ms 920 KB
subtask1_15.txt WA 42 ms 932 KB
subtask1_16.txt WA 44 ms 928 KB
subtask1_17.txt WA 44 ms 928 KB
subtask1_18.txt WA 46 ms 932 KB
subtask1_19.txt WA 42 ms 932 KB
subtask2_01.txt WA 250 ms 872 KB
subtask2_02.txt WA 160 ms 956 KB
subtask2_03.txt WA 168 ms 936 KB
subtask2_04.txt WA 499 ms 1052 KB
subtask2_05.txt WA 744 ms 1088 KB
subtask2_06.txt WA 732 ms 1084 KB
subtask2_07.txt WA 766 ms 1080 KB
subtask2_08.txt WA 684 ms 1084 KB
subtask2_09.txt WA 706 ms 1048 KB
subtask2_10.txt WA 704 ms 1088 KB
subtask2_11.txt WA 726 ms 1088 KB
subtask2_12.txt WA 720 ms 1076 KB
subtask2_13.txt WA 682 ms 1084 KB
subtask2_14.txt WA 755 ms 1084 KB
subtask2_15.txt WA 676 ms 1088 KB
subtask2_16.txt WA 842 ms 1084 KB
subtask2_17.txt WA 743 ms 1120 KB
subtask2_18.txt WA 763 ms 1044 KB
subtask2_19.txt WA 732 ms 1080 KB