CSES - Putka Open 2015 – 1/6 - Results
Submission details
Task:Aita
Sender:
Submission time:2015-07-19 15:26:23 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.07 s1details
#2ACCEPTED0.07 s1details
#30.09 s1details
#4ACCEPTED0.09 s1details
#50.09 s1details
#6ACCEPTED0.08 s2details
#70.08 s2details
#8ACCEPTED0.09 s2details
#90.09 s2details
#100.09 s2details
#110.09 s3details
#120.08 s3details
#130.57 s3details
#141.20 s3details
#15ACCEPTED0.09 s3details

Code

#include <iostream>
#include <stdio.h>
#include <algorithm>

using namespace std;

int main(int argc, char* argv[])
{
	ios_base::sync_with_stdio(false);
	int k, n;
	cin >> n >> k;
	//n määrä, k min ero
	int *planks = new int[n];
	for (int i = 0; i < n; i++)
		planks[i] = i + 1;
	int t = planks[0];
	if (k>(n / 2)){
		cout << "QAQ\n";
		return 0;
	}
	else{
		for (int i = 1; i < n; i++){
			if (planks[i] - t < k){
				//cout << "swap need" << i << "\n";
				for (int j = i + 1; j < n; j++){
					if ((planks[j] - t >= k) || (t-planks[j]>=k)){
						//cout << "swap\n";
						swap(planks[i], planks[j]);
						break;
					}
				}
			}
			t = planks[i];
		}
	}
	//cout << planks[0] << endl;
	for (int i = 1; i < n; i++){
		//cout << planks[i] << endl;
		if ((planks[i] - planks[i - 1] < k) && ((planks[i]-planks[i-1])*-1<k)){
			cout << "QAQ\n";
			//system("pause");
			return 0;
		}
	}
	//cout << "\n" << endl;
	for (int i = 0; i < n-1; i++)
		cout << planks[i] << " ";
	cout << planks[n - 1];
	//system("pause");
	return 0;
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
2 2

correct output
QAQ

user output
QAQ

Test 2

Group: 1

Verdict: ACCEPTED

input
3 2

correct output
QAQ

user output
QAQ

Test 3

Group: 1

Verdict:

input
4 2

correct output
3 1 4 2 

user output
QAQ

Test 4

Group: 1

Verdict: ACCEPTED

input
7 4

correct output
QAQ

user output
QAQ

Test 5

Group: 1

Verdict:

input
8 4

correct output
5 1 6 2 7 3 8 4 

user output
QAQ

Test 6

Group: 2

Verdict: ACCEPTED

input
80476 2

correct output
40239 1 40240 2 40241 3 40242 ...

user output
1 3 5 2 4 6 8 10 7 9 11 13 15 ...

Test 7

Group: 2

Verdict:

input
68652 2

correct output
34327 1 34328 2 34329 3 34330 ...

user output
QAQ

Test 8

Group: 2

Verdict: ACCEPTED

input
62735 2

correct output
31368 1 31369 2 31370 3 31371 ...

user output
1 3 5 2 4 6 8 10 7 9 11 13 15 ...

Test 9

Group: 2

Verdict:

input
71954 2

correct output
35978 1 35979 2 35980 3 35981 ...

user output
QAQ

Test 10

Group: 2

Verdict:

input
4 2

correct output
3 1 4 2 

user output
QAQ

Test 11

Group: 3

Verdict:

input
89814 3

correct output
44908 1 44909 2 44910 3 44911 ...

user output
QAQ

Test 12

Group: 3

Verdict:

input
91140 5

correct output
45571 1 45572 2 45573 3 45574 ...

user output
QAQ

Test 13

Group: 3

Verdict:

input
66703 16675

correct output
33352 1 33353 2 33354 3 33355 ...

user output
QAQ

Test 14

Group: 3

Verdict:

input
66666 33333

correct output
33334 1 33335 2 33336 3 33337 ...

user output
QAQ

Test 15

Group: 3

Verdict: ACCEPTED

input
66666 33334

correct output
QAQ

user output
QAQ