CSES - Datatähti 2024 alku

CSES - Datatähti 2024 alku - Results

Submission details
Task:	Käännöt
Sender:	Vludo
Submission time:	2023-11-10 23:43:36 +0200
Language:	C++11
Status:	READY
Result:	32

Feedback
group	verdict	score
#1	ACCEPTED	13
#2	ACCEPTED	19
#3	WRONG ANSWER	0
#4	WRONG ANSWER	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.00 s	1	details
#2	ACCEPTED	0.00 s	1	details
#3	ACCEPTED	0.00 s	1	details
#4	ACCEPTED	0.00 s	1	details
#5	ACCEPTED	0.00 s	1	details
#6	ACCEPTED	0.00 s	2	details
#7	ACCEPTED	0.90 s	2	details
#8	ACCEPTED	0.00 s	2	details
#9	ACCEPTED	0.00 s	2	details
#10	ACCEPTED	0.00 s	2	details
#11	ACCEPTED	0.01 s	2	details
#12	ACCEPTED	0.01 s	2	details
#13	ACCEPTED	0.01 s	2	details
#14	ACCEPTED	0.01 s	2	details
#15	ACCEPTED	0.00 s	2	details
#16	ACCEPTED	0.01 s	2	details
#17	ACCEPTED	0.00 s	3	details
#18	WRONG ANSWER	0.90 s	3	details
#19	WRONG ANSWER	0.01 s	3	details
#20	WRONG ANSWER	0.01 s	3	details
#21	WRONG ANSWER	0.01 s	3	details
#22	WRONG ANSWER	0.01 s	3	details
#23	ACCEPTED	0.01 s	3	details
#24	ACCEPTED	0.90 s	3	details
#25	WRONG ANSWER	0.01 s	3	details
#26	ACCEPTED	0.00 s	4	details
#27	WRONG ANSWER	0.90 s	4	details
#28	WRONG ANSWER	0.01 s	4	details
#29	WRONG ANSWER	0.01 s	4	details
#30	WRONG ANSWER	0.01 s	4	details
#31	WRONG ANSWER	0.01 s	4	details
#32	ACCEPTED	0.00 s	4	details
#33	WRONG ANSWER	0.01 s	4	details
#34	WRONG ANSWER	0.01 s	4	details

Code

/*
    C++ code author: Vludo
    Created: 2023-11-09 22:00:44
*/
#include <bits/stdc++.h>

#define forn(i, n) for(int i=0; i<n; i++)
#define FOR(i, j, n) for(int i=j; i<n; i++)
#define pb push_back
#define F first
#define S second
#define sz(a) ((int)(a).size())
#define all(a) (a).begin(),a.end()
#define ever ;;

typedef long long ll;

const int inf = 1.01e9;
const int mod = 1e9 + 7;

using namespace std;

int n, k;
vector<int> v, sv, startv;
vector<int> result; 
void sorting23(int k);
void sorting4(); 
void sorting5();
bool possible = 1;

double TIME() {
    return (double)clock() * 1. / CLOCKS_PER_SEC;
}

double time0 = TIME();


int main () {	
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	srand(time(NULL));
	// freopen("input1.txt", "r", stdin);
	
	cin >> n >> k;
	int a;
	forn(i, n){
		cin >> a;
		v.pb(a);
	}

	sv = startv = v;
	sort(sv.begin(), sv.end());
	
	switch (k) {
		case 2:
			sorting23(k);
			break;
		case 3:
			sorting23(k);
			break;
		case 4:
			sorting4();
			break;
		case 5:
			break;
	}
	
	
	while (v != sv) {
		if (!possible || TIME() - time0 > 0.9) {
			cout << "NO" << endl;
			// for(int i : v) cout << i << " ";
			// cout << endl << time0 - TIME() << endl;
			return 0;
		}
		
		result.clear();
		v.clear();
		
		v = startv;
		
		forn(i, 1e3) {
			int rpos = rand() % (n-(k-1));
			// cout << rpos << endl;
			// swap(v[rpos], v[rpos+3]); swap(v[rpos+1], v[rpos+2]);
			reverse(v.begin()+rpos+1, v.begin()+rpos+k-1);
			result.pb(rpos+1);
		}
		if (k == 4) sorting4();
		else sorting5();
	}
	cout << "YES\n" << result.size() << "\n";
	for(int i : result) cout << i << " ";
	cout << endl ; // << TIME() - time0 << endl;
	
	return 0;
}

void sorting23(int k) {
	while (v != sv) {
		bool ei = 1;
		forn(i, n-k+1) {
			if (v[i] > v[i+k-1]) {
				swap(v[i], v[i+k-1]);
				result.pb(i+1);
				ei = 0;
			}
		}
		if (ei) break;
	}
}

void sorting4() {
	FOR(i, 1, n-3) {
		if (result.size() > 1e6) break;
		int positio;
		forn(j, n) if (v[j]==i) {positio = j; break;}
		
		for (ever) {
			if (result.size() > 1e6) break;
			// for (int gg : v) cout << gg << " "; cout << endl << positio << " " << i << endl;
			if (positio == i-1) break;
			
			if (positio == i) {
				
				result.pb(positio);
				reverse(v.begin()+positio-1, v.begin()+positio+3); // small right
				positio++;
				
				result.pb(positio);
				reverse(v.begin()+positio-1, v.begin()+positio+3); // small right
				positio++;
				
				result.pb(positio-2);
				reverse(v.begin()+positio-3, v.begin()+positio+1); // big left
				positio -= 3;
			}
			
			else if (positio == i+1) {
				result.pb(positio);
				reverse(v.begin()+positio-1, v.begin()+positio+3); // small right
				positio++;
				
				result.pb(positio-2);
				reverse(v.begin()+positio-3, v.begin()+positio+1); // big left
				positio -= 3;
			}
			
			else {
				result.pb(positio-2);
				reverse(v.begin()+positio-3, v.begin()+positio+1); // big left
				positio -= 3;
			}
		}
	}		
	if (v == sv) return;
}

void sorting5() {
	FOR(i, 1, n-4) {
		if (result.size() > 1e6) break;
		int positio;
		forn(j, n) if (v[j]==i) {positio = j; break;}
		
		for (ever) {
			if (result.size() > 1e6) break;
			// for (int gg : v) cout << gg << " "; cout << endl << positio << " " << i << endl;
			if (positio == i-1) break;
			
			if (positio == i) {
				possible = 0;
				return;
			}
			
			else if (positio == i+1) {
				result.pb(positio);
				reverse(v.begin()+positio-1, v.begin()+positio+4); // small right
				positio += 2;
				
				result.pb(positio-3);
				reverse(v.begin()+positio-4, v.begin()+positio+1); // big left
				positio -= 4;
			}
			
			else if (positio == i+2) {
				possible = 0;
				return;
			}
			
			else {
				result.pb(positio-3);
				reverse(v.begin()+positio-4, v.begin()+positio+1); // big left
				positio -= 4;
			}
		}
	}		
	if (v == sv) return;
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

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

correct output
`YES 0` view save

user output
`YES 0` view save

Test 2

Group: 1

Verdict: ACCEPTED

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

correct output
`YES 1 1` view save

user output
`YES 1 1` view save

Test 3

Group: 1

Verdict: ACCEPTED

input
`20 2 6 20 18 2 16 13 19 17 8 14 11 ...` view save

correct output
`YES 366 2 3 4 5 6 7 8 9 10 11 12 13 14...` view save

user output
`YES 132 2 3 4 5 6 7 8 9 10 11 12 13 14...` Truncated

Test 4

Group: 1

Verdict: ACCEPTED

input
`100 2 100 92 62 88 12 7 43 31 19 72 ...` view save

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

user output
`YES 2438 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` Truncated

Test 5

Group: 1

Verdict: ACCEPTED

input
`100 2 100 99 98 97 96 95 94 93 92 91...` view save

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

user output
`YES 4950 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` Truncated

Test 6

Group: 2

Verdict: ACCEPTED

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

correct output
`YES 0` view save

user output
`YES 0` view save

Test 7

Group: 2

Verdict: ACCEPTED

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

correct output
`NO` view save

user output
`NO` view save

Test 8

Group: 2

Verdict: ACCEPTED

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

correct output
`YES 8 1 2 1 3 1 2 3 1` view save

user output
`YES 2 1 3` view save

Test 9

Group: 2

Verdict: ACCEPTED

input
`20 3 19 14 1 18 3 4 11 20 13 6 17 8...` view save

correct output
`YES 52 8 10 12 14 16 18 1 3 5 7 9 11 ...` view save

user output
`YES 42 1 3 4 5 7 8 9 10 11 12 13 14 1...` Truncated

Test 10

Group: 2

Verdict: ACCEPTED

input
`20 3 9 6 13 18 5 10 3 2 7 20 1 4 19...` view save

correct output
`YES 50 10 12 14 16 18 13 15 17 4 6 8 ...` view save

user output
`YES 34 3 4 5 6 7 9 10 12 13 14 15 16 ...` view save

Test 11

Group: 2

Verdict: ACCEPTED

input
`500 3 53 52 21 76 25 142 5 4 83 176 ...` view save

correct output
`YES 15194 334 336 338 340 342 344 346 34...` view save

user output
`YES 15174 1 3 5 6 10 11 12 13 14 15 16 1...` Truncated

Test 12

Group: 2

Verdict: ACCEPTED

input
`500 3 51 44 147 172 1 28 27 82 233 1...` view save

correct output
`YES 15565 366 368 370 372 374 376 378 38...` view save

user output
`YES 15543 3 4 5 6 8 10 11 12 13 15 16 17...` Truncated

Test 13

Group: 2

Verdict: ACCEPTED

input
`500 3 75 46 179 62 221 14 67 154 89 ...` view save

correct output
`YES 15920 454 456 458 460 462 464 466 46...` view save

user output
`YES 15902 4 5 7 9 10 11 12 13 14 15 16 1...` Truncated

Test 14

Group: 2

Verdict: ACCEPTED

input
`500 3 161 54 285 12 71 142 111 94 97...` view save

correct output
`YES 15931 408 410 412 414 416 418 420 42...` view save

user output
`YES 15907 2 3 5 6 7 8 9 10 11 13 15 16 1...` Truncated

Test 15

Group: 2

Verdict: ACCEPTED

input
`500 3 122 260 455 113 315 276 433 43...` view save

correct output
`NO` view save

user output
`NO` view save

Test 16

Group: 2

Verdict: ACCEPTED

input
`500 3 499 500 497 498 495 496 493 49...` view save

correct output
`YES 62264 2 4 6 8 10 12 14 16 18 20 22 2...` view save

user output
`YES 62250 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` Truncated

Test 17

Group: 3

Verdict: ACCEPTED

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

correct output
`YES 0` view save

user output
`YES 0` view save

Test 18

Group: 3

Verdict: WRONG ANSWER

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

correct output
`YES 4 1 2 1 2` view save

user output
`NO` view save

Test 19

Group: 3

Verdict: WRONG ANSWER

input
`500 4 58 14 107 124 4 113 24 290 56 ...` view save

correct output
`YES 15698 389 392 395 398 401 404 407 41...` view save

user output
`YES 15902 394 46 181 2 403 114 74 236 43...` Truncated

Test 20

Group: 3

Verdict: WRONG ANSWER

input
`500 4 113 187 278 242 23 67 48 298 3...` view save

correct output
`YES 15004 480 481 480 482 485 488 491 49...` view save

user output
`YES 15118 276 343 464 404 36 175 384 217...` Truncated

Test 21

Group: 3

Verdict: WRONG ANSWER

input
`500 4 5 233 199 35 213 354 11 134 30...` view save

correct output
`YES 16770 458 461 464 467 470 473 476 47...` view save

user output
`YES 16787 245 352 390 277 374 63 284 217...` Truncated

Test 22

Group: 3

Verdict: WRONG ANSWER

input
`500 4 169 47 21 137 57 138 360 147 4...` view save

correct output
`YES 15889 497 371 372 371 373 376 379 38...` view save

user output
`YES 16090 481 101 121 390 404 131 261 25...` Truncated

Test 23

Group: 3

Verdict: ACCEPTED

input
`500 4 493 409 291 313 156 443 496 40...` view save

correct output
`YES 22886 480 481 480 482 485 488 491 49...` view save

user output
`YES 22039 338 335 332 329 326 323 320 31...` Truncated

Test 24

Group: 3

Verdict: ACCEPTED

input
`500 4 137 99 100 226 326 298 140 340...` view save

correct output
`NO` view save

user output
`NO` view save

Test 25

Group: 3

Verdict: WRONG ANSWER

input
`500 4 500 499 498 497 496 495 494 49...` view save

correct output
`YES 41458 1 2 1 2 5 8 11 14 17 20 23 26 ...` view save

user output
`YES 42823 6 178 357 226 442 186 318 383 ...` Truncated

Test 26

Group: 4

Verdict: ACCEPTED

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

correct output
`YES 0` view save

user output
`YES 0` view save

Test 27

Group: 4

Verdict: WRONG ANSWER

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

correct output
`YES 1 1` view save

user output
`NO` view save

Test 28

Group: 4

Verdict: WRONG ANSWER

input
`500 5 145 26 285 154 147 314 141 40 ...` view save

correct output
`YES 13786 216 220 224 228 232 236 240 24...` view save

user output
`YES 14289 309 132 50 318 308 493 243 53 ...` Truncated

Test 29

Group: 4

Verdict: WRONG ANSWER

input
`500 5 137 22 399 292 249 6 51 224 42...` view save

correct output
`YES 13465 456 460 464 468 472 476 480 48...` view save

user output
`YES 14206 12 270 217 166 101 428 285 139...` Truncated

Test 30

Group: 4

Verdict: WRONG ANSWER

input
`500 5 153 52 85 100 329 60 433 468 4...` view save

correct output
`YES 13642 377 378 377 380 384 388 392 39...` view save

user output
`YES 14112 241 379 318 129 402 65 53 327 ...` Truncated

Test 31

Group: 4

Verdict: WRONG ANSWER

input
`500 5 267 326 95 108 189 32 291 366 ...` view save

correct output
`YES 14639 213 214 213 216 220 224 228 23...` view save

user output
`YES 15113 241 379 318 129 402 65 53 327 ...` Truncated

Test 32

Group: 4

Verdict: ACCEPTED

input
`500 5 15 450 272 80 321 101 247 438 ...` view save

correct output
`NO` view save

user output
`NO` view save

Test 33

Group: 4

Verdict: WRONG ANSWER

input
`499 5 497 498 499 496 495 494 493 49...` view save

correct output
`YES 30886 3 7 11 15 19 23 27 31 35 39 43...` view save

user output
`YES 31588 333 169 346 331 32 457 319 135...` Truncated

Test 34

Group: 4

Verdict: WRONG ANSWER

input
`500 5 499 500 497 498 495 496 493 49...` view save

correct output
`YES 30919 1 4 8 12 16 20 24 28 32 36 40 ...` view save

user output
`YES 32114 56 31 283 308 225 53 333 464 4...` Truncated

Datatähti 2024 alku

Käännöt

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Test 31

Test 32

Test 33

Test 34

Tasks

Submissions (Vludo)