— Dark mode

Datatähti 2016 peili

Kirjat

  • Start: 2015-09-28 00:00:00
  • End: 2015-10-12 00:00:00
Submission details
Task:Kirjat
Sender:hello_world
Submission time:2015-10-01 11:02:09 +0300
Language:C++
Status:READY
Result:0
Feedback
subtaskverdictscore
#10
#20
#30
Test results
testverdicttimesubtask
#1ACCEPTED0.06 s1details
#20.06 s1details
#30.06 s1details
#4ACCEPTED0.05 s1details
#5ACCEPTED0.05 s1details
#6ACCEPTED0.06 s1details
#70.06 s1details
#80.05 s1details
#9ACCEPTED0.05 s1details
#10ACCEPTED0.06 s1details
#11ACCEPTED0.06 s1details
#12ACCEPTED0.06 s1details
#13ACCEPTED0.06 s1details
#14ACCEPTED0.06 s1details
#150.06 s1details
#16ACCEPTED0.05 s1details
#17ACCEPTED0.05 s1details
#18ACCEPTED0.06 s1details
#19ACCEPTED0.06 s1details
#20ACCEPTED0.05 s1details
#21ACCEPTED0.06 s2details
#220.07 s2details
#230.06 s2details
#24--2details
#25ACCEPTED0.05 s2details
#260.06 s2details
#27ACCEPTED0.05 s2details
#28ACCEPTED0.06 s2details
#29ACCEPTED0.05 s2details
#30--2details
#31ACCEPTED0.05 s2details
#32ACCEPTED0.06 s2details
#33ACCEPTED0.07 s2details
#34ACCEPTED0.05 s2details
#350.06 s2details
#36ACCEPTED0.06 s2details
#37ACCEPTED0.06 s2details
#38ACCEPTED0.06 s2details
#39ACCEPTED0.05 s2details
#40ACCEPTED0.05 s2details
#41ACCEPTED0.06 s3details
#42ACCEPTED0.05 s3details
#43ACCEPTED0.06 s3details
#440.05 s3details
#450.06 s3details
#46ACCEPTED0.05 s3details
#470.06 s3details
#48ACCEPTED0.05 s3details
#49ACCEPTED0.05 s3details
#500.06 s3details
#510.05 s3details
#52ACCEPTED0.06 s3details
#530.06 s3details
#54--3details
#55ACCEPTED0.07 s3details
#56ACCEPTED0.13 s3details
#57ACCEPTED0.13 s3details
#58ACCEPTED0.11 s3details
#59ACCEPTED0.12 s3details
#60ACCEPTED0.14 s3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:92:8: warning: unused variable 'canDo' [-Wunused-variable]
   bool canDo = false;
        ^

Code

#include <stdio.h>
#include <iostream>
#include <string>
#include <string.h>
#include <stdlib.h>

using namespace std;

struct List{
	unsigned int x;
	List *next;
	List *last;
};

void freeMemory(List *list);
void printMemory(List *list);

int main(void){
	
	List *a, *b, *a2;
	a = NULL;
	a2 = NULL;
	b = NULL;
	
	List *ap, *bp, *ap2;
	unsigned int count;
	
	cin >> count;
	
	unsigned int countMinusOne = count - 1;
	unsigned int c = count;
	
	a = (struct List *)malloc(sizeof(struct List));
	a->last = NULL; a->next = NULL;
	ap = a;
	while(c--){
		cin >> ap->x;
		//cout << c << " : " << ap->x << endl;
		if (c){
			ap->next = (struct List *)malloc(sizeof(struct List));
			(ap->next)->last = ap;
			(ap->next)->next = NULL;
			ap = ap->next;
		}
	}
	
	a2 = (struct List *)malloc(sizeof(struct List));
	a2->last = NULL; a2->next = NULL;
	ap2 = a2;
	c = count;
	while(c--){
		cin >> ap2->x;
		//cout << c << " : " << ap->x << endl;
		if (c){
			ap2->next = (struct List *)malloc(sizeof(struct List));
			(ap2->next)->last = ap2;
			(ap2->next)->next = NULL;
			ap2 = ap2->next;
		}
	}  
	
	//swapataan a ja a2
	
	List *x1 = a;	//aloitetaan lista a alusta, s?ilytet??n ap kuitenkin, nimet??n uusi pointer x1
	List *x2 = a2;
	unsigned int swap_c[2] ={count + 1, count + 1};
	
	
	c = count;
	unsigned int temp;
	
	//tarkistetaan kahden viimeisen alkion muuttujat, eli että onko järjeä swapata, ja sen jälkeen testataan voidaanko swapata
	
	bool tryToSwap[2] = {false, false};
	bool swap[2] = {0, 0};					//tästä katsotaan myöhemmin, mitkä swapattiin
	
	if (ap->x >= countMinusOne || ap2->x >= countMinusOne) tryToSwap[1] = true;
	if ((ap->last)->x >= countMinusOne || (ap2->last)->x >= countMinusOne) tryToSwap[0] = true;
	//cout << (ap->last)->x << " " << (ap2->last)->x << " " << countMinusOne << endl;
	
	if (tryToSwap[0] || tryToSwap[1]){
		unsigned int trySwap;	//katsotaan swapataanko kaksi, vai yksi(ja kumpi)
	
		if (tryToSwap[0] && tryToSwap[1]) trySwap = 2;
		else if (tryToSwap[1]) trySwap = 1;
		else trySwap = 0;
		
		//cout << "trys: " << tryToSwap[0] << " " << tryToSwap[1] << endl;
		//cout << "try: " << trySwap << endl;
	
		bool canDo = false;
		
		while (c--) {	//selataan a:ta ja a:sta eteenpäin, kunnes kumpikin on alle countMinusOne
			
			if (x1->x < countMinusOne && x2->x < countMinusOne) {
				
				if (!swap[1] && trySwap != 0){	//swap num 1:stä ei ole tehty, eli viimeistä ei ole swapattu
					
					temp = x1->x;
					x1->x = ap->x;
					ap->x = temp;
					
					temp = x2->x;
					x2->x = ap2->x;
					ap2->x = temp;
					
					swap_c[1] = c;
						
					//tallennetaan c, jotta voidaan sen avulla tehdä takaisin swappaus
					
					swap[1] = 1;
					
					if (trySwap == 1) break;
					
				} else {	//swap[0], tryswap 2, 0
					//while(1);
					temp = x1->x;
					x1->x = (ap->last)->x;
					(ap->last)->x = temp;
					
					temp = x2->x;
					x2->x = (ap2->last)->x;
					(ap2->last)->x = temp;
					
					swap_c[0] = c;
					swap[0] = 1;
					
					break;	//molemmat swap:it on tehty, voidaan poistua
				}
			}
			
			x1 = x1->next;
			x2 = x2->next;
		}
	}
	
	
	
	
	
	c = count;
	//unsigned int x2;		//b-lukujono, tyyli1 hankalampi swap
	unsigned int m[2] = {0, 0};		//memory, size 2, voidaan k?ytt?? lukua 0 tyhj?n?, t?ytet??n indeksist? nolla eteenp?in
	unsigned int cur = 1;	//menneill??n oleva luku, jota halutaan kokeilla laittaa uuteen lukujonoon
	
	b = (struct List *)malloc(sizeof(struct List));	//b
	b->last = NULL; b->next = NULL;
	bp = b;
	x1 = a;	//aloitetaan lista a alusta, s?ilytet??n ap kuitenkin, nimet??n uusi pointer x1
	x2 = a2;
	
	//cout << endl;printMemory(a);
	//cout << endl;printMemory(a2);
	
	while(c--){
		
		//otetaan muistista 0:sta jos mahdollista, jos ei otetaan 1:st? jos mahdollista
		//muutoin nostetaan cur:ia yhdell?:
			//jos se voidaan laittaa, laitetaan se
			//jos sit? ei voida laittaa, lis?t??n muistiin, jos muisti 0 on k?ytetty lis?t??n paikalle 1, muutoin paikalle nolla
		//if (m[1] && m[0] > m[1]) ei pidä koskaan paikaansa
		if (m[0]) {	//m[0] on aina pienempi kuin m[1]
			if (m[0] != x2->x && m[0] != x1->x){					//mem 0 voidaanko k?ytt??, tarkistetaan t?m? ensin, sill? t?m? on pienempi kuin m1
				bp->x = m[0];
				//cout << "yea1";
				if (m[1]) {
					m[0] = m[1];		//m[1] on nyt v?kistenkin pienin
					m[1] = 0;//cur;			//joten vaihdetaan se m[0]:n tilalle ja tallennetaan uusi cur m[1]:seen
				} else m[0] = 0;
			} else if (m[1] && (m[1] != x2->x && m[1] != x1->x)) {	//mem 1 voidaanko k?ytt??
				bp->x = m[1];
				
				//cout << "yea2(" << m[1] << " " << x2->x << " " << x1->x << ")";
				m[1] = 0;//cur;		//m[0] pysyy edelleen pienimp?n?, vaihdetaan cur m[1]:sen tilalle
				//verrataan cur:ia m[0]:aan ja m[1:seen]
			} 	//nyt muistissa on joko m[0] tai m[0] ja m[1], sill? cur:ia ei voitu k?ytt?? ja se vaihdettiin toisen m:n tilalle
			else {	//muistia ei voitu k?ytt??, siirryt??n valintaan(goto)
				//cur++;
				//cout << "goto";
				goto valinta;
			} //cout << "yea";
			//cout << "muistiin" << cur << " ";
		} else {	//jos muistissa ei ole lukuja, voidaanko cur k?ytt??
			while(cur == x2->x || cur == x1->x) {	//cur:ia ei voida laittaa, laitetaan se muistiin, sill? muisti on tyhj?
				if (!m[0]) m[0] = cur;	//jos nollapaikkaa ei ole t?ytetty t?ytet??n se
				else m[1] = cur;		//muutoin t?ytet??n paikka 1
				cur++;		//aina lis?t??n v?h.1 kun tullaan t?nne, jotta voidaan tarkistaa mem uudelleen(m)
			}	//nyt voitaisiin laittaa, nyt voidaan laittaa, muistista ei voida edelleenk??n laittaa, joten laitetaan cur
			valinta:
			bp->x = cur; 
			cur++;
			//cout << "valitaan" << cur << " ";
		}
		//cout << bp->x;
		if (c){
			bp->next = (struct List *)malloc(sizeof(struct List));
			(bp->next)->last = bp;
			(bp->next)->next = NULL;
			bp = bp->next;
		}
		x1 = x1->next;
		x2 = x2->next;
	}
	
	//cout << endl;printMemory(a);
	//cout << endl;printMemory(a2);
	
	//cout << "asdf";
	
	//kaikki on nyt muuten järjestyksessä, paitsi että pitää vielä swapatut alkiot vaihtaa takaisin omille paikoilleen
	//cout << "asdfasdf";
	//x1_swap[1]->x ^= (ap->last)->x ^= x1_swap[1]->x ^= (ap->last)->x;
	//cout << "\nasdfasdf";
	//x1_swap[0]->x ^= ap->x ^= x1_swap[0]->x ^= ap->x;
	
	//x2_swap[1]->x ^= (ap2->last)->x ^= x2_swap[1]->x ^= (ap2->last)->x;
	//x2_swap[0]->x ^= ap2->x ^= x2_swap[0]->x ^= ap2->x;
	//cout << "\nasdfasdf";
	
	List *bx = b;
	
	//cout << endl;cout << endl;
	//cout << endl;printMemory(b);
	c = count;
	x1 = a;
	x2 = a2;
	bx = b;
	
	/*cout << endl;
	cout << endl;printMemory(b);
	cout << endl;printMemory(a);
	cout << endl;printMemory(a2);
	cout << endl;
	*/
	
	while (x1->next != NULL){
		if (bx->x == x1->x || bx->x == x2->x){
			//cout << bx->x << " " << x1->x << " " << x2->x << endl;
			while(1);	//menee ainakin joskus tänne, eli jokin on pielessä
		}
		x1 = x1->next;
		x2 = x2->next;
		bx = bx->next;
	}
	
	c = count;
	bx = b;
	
	if (swap[0] || swap[1]) {
		
		while(c--){	//voidaan tehdä c:llä, koska nämä ovat viimeistään c= count - 3 ja c = .. 4
			if (swap[1] && swap_c[1] == c){
				
				//cout << endl << " c: " << c << " " << b->x << " -> " << bp->x << endl;
				
				temp = bx->x;
				bx->x = bp->x;
				bp->x = temp;
				
				
				//cout << endl;printMemory(b);
				
				if (!swap[0]) break;
				
			} else if (swap[0] && swap_c[0] == c){
				
				//List *temp_list = bp->last;
				
				//cout << endl << " c2: " << c << " " << b->x << " -> " << (bp->last)->x << endl;
				
				temp = bx->x;
				bx->x = (bp->last)->x;
				(bp->last)->x = temp;
				
				
				//cout << endl;printMemory(b);
				break; 
			} 
			bx = bx->next;
		}
	}
	
	//tarkistetaan meneekö swap oikein
	
	
	
	cout << endl;printMemory(b);
	//cout << endl;printMemory(a);
	//cout << endl;printMemory(a2);
	
	//käydään muodostettu lista läpi, katsotaan onko se oikein rakennettu, jos ei ole tehdään runtime-error
	
	
	
		
	freeMemory(ap2);
	freeMemory(bp);
	freeMemory(ap);
	
	
	return 0;
	
	
	
}

void printMemory(List *list){
	List *l = list;
	while (l->next != NULL){
		cout << l->x << " ";
		l = l->next;
	}
	cout << l->x << " ";
}

void freeMemory(List *list){
	
	/*while (list->next != NULL){
		list = list->next;
	}*/
	List *l;
	do {
		l = list;
		list = list->last;
		free(l);
	} while(list->last != NULL);
}

Test details

Test 1

Subtask: 1

Verdict: ACCEPTED

input
3
2 1 3
3 2 1
view save

correct output
1 3 2 
view save

user output

1 3 2 
view save

Test 2

Subtask: 1

Verdict:

input
4
2 1 4 3
1 4 3 2
view save

correct output
4 3 2 1 
view save

user output

5 2 1 3 
view save

Test 3

Subtask: 1

Verdict:

input
4
4 3 2 1
3 1 4 2
view save

correct output
1 2 3 4 
view save

user output

1 2 5 3 
view save

Test 4

Subtask: 1

Verdict: ACCEPTED

input
4
3 4 2 1
2 3 1 4
view save

correct output
1 2 4 3 
view save

user output

1 2 4 3 
view save

Test 5

Subtask: 1

Verdict: ACCEPTED

input
4
4 1 3 2
2 3 1 4
view save

correct output
1 4 2 3 
view save

user output

1 2 4 3 
view save

Test 6

Subtask: 1

Verdict: ACCEPTED

input
5
5 1 3 2 4
3 4 2 1 5
view save

correct output
2 3 4 5 1 
view save

user output

1 2 5 4 3 
view save

Test 7

Subtask: 1

Verdict:

input
5
4 2 3 5 1
3 5 2 1 4
view save

correct output
1 4 5 2 3 
view save

user output

1 3 6 2 4 
view save

Test 8

Subtask: 1

Verdict:

input
5
1 4 3 2 5
4 3 1 5 2
view save

correct output
3 2 5 1 4 
view save

user output

2 1 6 3 4 
view save

Test 9

Subtask: 1

Verdict: ACCEPTED

input
5
5 3 2 1 4
4 2 1 3 5
view save

correct output
1 4 5 2 3 
view save

user output

1 5 3 4 2 
view save

Test 10

Subtask: 1

Verdict: ACCEPTED

input
5
4 3 5 1 2
5 1 3 2 4
view save

correct output
2 5 1 4 3 
view save

user output

1 5 2 4 3 
view save

Test 11

Subtask: 1

Verdict: ACCEPTED

input
5
5 1 3 2 4
2 5 4 3 1
view save

correct output
3 4 2 1 5 
view save

user output

1 2 5 4 3 
view save

Test 12

Subtask: 1

Verdict: ACCEPTED

input
5
5 4 2 1 3
2 3 5 4 1
view save

correct output
3 1 4 5 2 
view save

user output

1 2 3 5 4 
view save

Test 13

Subtask: 1

Verdict: ACCEPTED

input
5
1 5 2 4 3
5 1 4 3 2
view save

correct output
3 2 5 1 4 
view save

user output

2 3 1 5 4 
view save

Test 14

Subtask: 1

Verdict: ACCEPTED

input
5
5 3 4 2 1
3 5 2 1 4
view save

correct output
1 2 3 4 5 
view save

user output

1 2 3 4 5 
view save

Test 15

Subtask: 1

Verdict:

input
5
4 5 3 2 1
3 2 1 4 5
view save

correct output
5 3 2 1 4 
view save

user output

1 3 5 2 4 
view save

Test 16

Subtask: 1

Verdict: ACCEPTED

input
10
4 9 1 10 6 8 7 2 3 5
8 5 7 3 1 6 4 10 2 9
view save

correct output
3 1 9 2 4 7 8 6 5 10 
view save

user output

10 2 3 4 5 7 6 8 9 1 
view save

Test 17

Subtask: 1

Verdict: ACCEPTED

input
10
6 10 8 2 3 5 7 1 4 9
4 1 2 10 5 6 9 3 8 7
view save

correct output
5 7 1 3 9 2 4 10 6 8 
view save

user output

10 2 3 4 6 7 5 8 9 1 
view save

Test 18

Subtask: 1

Verdict: ACCEPTED

input
10
8 2 9 10 1 6 4 7 3 5
3 8 4 5 6 7 9 10 1 2
view save

correct output
1 6 8 9 5 4 10 3 2 7 
view save

user output

1 3 2 4 5 8 6 9 7 10 
view save

Test 19

Subtask: 1

Verdict: ACCEPTED

input
10
6 3 8 9 5 7 4 10 1 2
8 9 10 1 3 6 2 7 4 5
view save

correct output
5 1 6 2 8 10 7 3 9 4 
view save

user output

1 2 3 4 6 5 7 8 9 10 
view save

Test 20

Subtask: 1

Verdict: ACCEPTED

input
10
8 3 5 6 2 10 4 7 1 9
4 7 8 10 5 2 6 1 9 3
view save

correct output
1 5 7 3 10 6 9 4 2 8 
view save

user output

10 9 3 4 6 5 7 8 2 1 
view save

Test 21

Subtask: 2

Verdict: ACCEPTED

input
3
3 2 1
1 3 2
view save

correct output
2 1 3 
view save

user output

2 1 3 
view save

Test 22

Subtask: 2

Verdict:

input
4
2 3 1 4
1 4 3 2
view save

correct output
3 2 4 1 
view save

user output

4 2 1 3 
view save

Test 23

Subtask: 2

Verdict:

input
4
2 4 3 1
4 1 2 3
view save

correct output
3 2 1 4 
view save

user output

1 2 4 5 
view save

Test 24

Subtask: 2

Verdict:

input
4
4 1 2 3
1 3 4 2
view save

correct output
3 2 1 4 
view save

user output
(empty)

Test 25

Subtask: 2

Verdict: ACCEPTED

input
4
2 1 3 4
4 3 2 1
view save

correct output
3 4 1 2 
view save

user output

1 2 4 3 
view save

Test 26

Subtask: 2

Verdict:

input
5
2 5 3 1 4
4 2 1 5 3
view save

correct output
5 4 2 3 1 
view save

user output

1 3 6 2 4 
view save

Test 27

Subtask: 2

Verdict: ACCEPTED

input
5
1 4 3 2 5
5 2 4 1 3
view save

correct output
4 5 2 3 1 
view save

user output

2 1 5 3 4 
view save

Test 28

Subtask: 2

Verdict: ACCEPTED

input
5
1 4 2 3 5
2 3 1 5 4
view save

correct output
4 5 3 1 2 
view save

user output

5 2 3 4 1 
view save

Test 29

Subtask: 2

Verdict: ACCEPTED

input
5
4 5 2 3 1
5 3 1 2 4
view save

correct output
1 2 3 4 5 
view save

user output

1 2 5 4 3 
view save

Test 30

Subtask: 2

Verdict:

input
5
3 2 1 5 4
5 4 3 1 2
view save

correct output
4 5 2 3 1 
view save

user output
(empty)

Test 31

Subtask: 2

Verdict: ACCEPTED

input
5
5 3 1 2 4
3 2 4 1 5
view save

correct output
4 5 2 3 1 
view save

user output

1 5 3 4 2 
view save

Test 32

Subtask: 2

Verdict: ACCEPTED

input
5
5 4 1 2 3
1 5 3 4 2
view save

correct output
2 3 4 5 1 
view save

user output

2 1 4 3 5 
view save

Test 33

Subtask: 2

Verdict: ACCEPTED

input
5
1 4 5 3 2
3 5 2 4 1
view save

correct output
5 1 3 2 4 
view save

user output

4 2 3 1 5 
view save

Test 34

Subtask: 2

Verdict: ACCEPTED

input
5
3 4 2 1 5
1 5 3 4 2
view save

correct output
2 3 4 5 1 
view save

user output

5 2 4 3 1 
view save

Test 35

Subtask: 2

Verdict:

input
5
2 3 1 5 4
5 4 2 1 3
view save

correct output
1 2 3 4 5 
view save

user output

1 2 4 5 3 
view save

Test 36

Subtask: 2

Verdict: ACCEPTED

input
1000
63 72 78 267 740 551 517 698 6...
view save

correct output
26 926 267 321 385 444 968 690...
view save

user output

1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view save

Test 37

Subtask: 2

Verdict: ACCEPTED

input
1000
954 273 839 263 331 161 938 51...
view save

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view save

user output

1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view save

Test 38

Subtask: 2

Verdict: ACCEPTED

input
1000
740 142 781 837 759 392 582 14...
view save

correct output
111 291 702 70 561 469 707 897...
view save

user output

1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view save

Test 39

Subtask: 2

Verdict: ACCEPTED

input
1000
960 550 210 529 691 277 63 975...
view save

correct output
716 604 535 519 27 204 574 592...
view save

user output

1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view save

Test 40

Subtask: 2

Verdict: ACCEPTED

input
1000
371 772 197 202 504 931 4 46 6...
view save

correct output
26 926 267 321 385 444 968 690...
view save

user output

1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view save

Test 41

Subtask: 3

Verdict: ACCEPTED

input
3
1 2 3
3 1 2
view save

correct output
2 3 1 
view save

user output

2 3 1 
view save

Test 42

Subtask: 3

Verdict: ACCEPTED

input
4
4 2 3 1
2 3 1 4
view save

correct output
1 4 2 3 
view save

user output

1 4 2 3 
view save

Test 43

Subtask: 3

Verdict: ACCEPTED

input
4
2 1 4 3
4 3 1 2
view save

correct output
1 2 3 4 
view save

user output

1 2 3 4 
view save

Test 44

Subtask: 3

Verdict:

input
4
1 4 2 3
2 3 4 1
view save

correct output
3 2 1 4 
view save

user output

5 1 2 3 
view save

Test 45

Subtask: 3

Verdict:

input
4
2 1 4 3
1 3 2 4
view save

correct output
4 2 3 1 
view save

user output

5 2 1 3 
view save

Test 46

Subtask: 3

Verdict: ACCEPTED

input
5
3 1 5 2 4
5 4 2 1 3
view save

correct output
1 2 3 4 5 
view save

user output

1 2 3 4 5 
view save

Test 47

Subtask: 3

Verdict:

input
5
2 1 5 3 4
5 3 2 4 1
view save

correct output
4 5 3 1 2 
view save

user output

1 5 3 2 4 
view save

Test 48

Subtask: 3

Verdict: ACCEPTED

input
5
5 1 4 3 2
3 5 1 2 4
view save

correct output
1 2 3 4 5 
view save

user output

1 2 3 4 5 
view save

Test 49

Subtask: 3

Verdict: ACCEPTED

input
5
2 4 1 3 5
3 5 4 1 2
view save

correct output
5 1 3 2 4 
view save

user output

5 2 3 4 1 
view save

Test 50

Subtask: 3

Verdict:

input
5
5 2 3 4 1
2 1 4 3 5
view save

correct output
1 4 5 2 3 
view save

user output

1 6 5 2 3 
view save

Test 51

Subtask: 3

Verdict:

input
5
4 1 5 3 2
2 4 1 5 3
view save

correct output
1 2 3 4 5 
view save

user output

1 2 3 6 4 
view save

Test 52

Subtask: 3

Verdict: ACCEPTED

input
5
3 1 5 2 4
1 4 2 3 5
view save

correct output
5 2 1 4 3 
view save

user output

5 2 3 4 1 
view save

Test 53

Subtask: 3

Verdict:

input
5
1 4 5 3 2
4 2 3 5 1
view save

correct output
5 3 2 1 4 
view save

user output

2 1 4 6 3 
view save

Test 54

Subtask: 3

Verdict:

input
5
1 4 5 2 3
4 2 3 1 5
view save

correct output
2 3 4 5 1 
view save

user output
(empty)

Test 55

Subtask: 3

Verdict: ACCEPTED

input
5
4 5 3 2 1
5 3 4 1 2
view save

correct output
1 2 5 3 4 
view save

user output

1 2 5 3 4 
view save

Test 56

Subtask: 3

Verdict: ACCEPTED

input
100000
74620 99226 537 63830 13777 69...
view save

correct output
44158 25720 84658 90057 99607 ...
view save

user output

1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view save

Test 57

Subtask: 3

Verdict: ACCEPTED

input
100000
67665 19864 90761 58104 38796 ...
view save

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view save

user output

1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view save

Test 58

Subtask: 3

Verdict: ACCEPTED

input
100000
63021 24161 40379 69157 89616 ...
view save

correct output
4913 70683 13897 99969 66725 3...
view save

user output

1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view save

Test 59

Subtask: 3

Verdict: ACCEPTED

input
100000
31500 70052 90949 56812 73871 ...
view save

correct output
47064 17335 15460 80797 56435 ...
view save

user output

1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view save

Test 60

Subtask: 3

Verdict: ACCEPTED

input
100000
39127 4446 57817 67459 53741 8...
view save

correct output
96591 75698 82505 59416 72144 ...
view save

user output

1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view save

Tasks

A Osajono-B Kirjat-C Tontti-D Lennot-E Bittipeli-

Submissions (hello_world)

2015-10-01 15:24:57 1002015-10-01 11:50:22 02015-10-01 11:48:34 02015-10-01 11:46:37 02015-10-01 11:45:30 02015-10-01 11:42:18 02015-10-01 11:41:04 02015-10-01 11:39:07 02015-10-01 11:37:53 02015-10-01 11:36:37 02015-10-01 11:35:34 02015-10-01 11:34:23 02015-10-01 11:32:45 02015-10-01 11:29:52 02015-10-01 11:27:10 02015-10-01 11:19:49 02015-10-01 11:07:06 02015-10-01 11:05:15 02015-10-01 11:02:09 02015-10-01 10:44:43 02015-10-01 10:43:03 02015-10-01 10:39:50 02015-10-01 10:37:53 02015-10-01 10:34:57 02015-10-01 10:33:31 02015-10-01 10:32:02 02015-10-01 10:29:57 02015-10-01 10:28:10 02015-10-01 10:26:06 02015-10-01 10:24:28 02015-10-01 10:20:50 02015-10-01 10:18:34 02015-10-01 10:15:26 02015-10-01 10:11:06 02015-10-01 10:08:52 02015-10-01 10:07:37 02015-10-01 10:06:22 02015-10-01 10:03:53 02015-10-01 10:02:44 02015-10-01 09:58:06 02015-10-01 09:39:09 02015-10-01 01:21:23 02015-10-01 01:04:19 02015-10-01 01:01:28 02015-10-01 00:57:47 02015-09-30 23:15:45 0