Code Submission Evaluation System Login

Datatähti 2015 loppu

Start:2015-01-29 12:15:00
End:2015-01-29 17:15:00
 

Tasks | Scoreboard | Statistics


CSES - Datatähti 2015 loppu - Results
History
2015-01-29 16:08:1612
2015-01-29 12:47:440
Task:Urkupillit
Sender:Ollie
Submission time:2015-01-29 16:08:16
Language:C++
Status:READY
Score:12

Feedback

groupverdictscore
#1ACCEPTED12
#2TIME LIMIT EXCEEDED0
#3TIME LIMIT EXCEEDED0

Test results

testverdicttime (s)group
#1ACCEPTED0.05 / 2.001details
#2ACCEPTED0.06 / 2.001details
#3ACCEPTED0.06 / 2.001details
#4ACCEPTED0.05 / 2.001details
#5ACCEPTED0.06 / 2.001details
#6ACCEPTED0.05 / 2.002details
#7TIME LIMIT EXCEEDED-- / 2.002details
#8TIME LIMIT EXCEEDED-- / 2.002details
#9TIME LIMIT EXCEEDED-- / 2.002details
#10TIME LIMIT EXCEEDED-- / 2.002details
#11ACCEPTED0.09 / 2.003details
#12TIME LIMIT EXCEEDED-- / 2.003details
#13TIME LIMIT EXCEEDED-- / 2.003details
#14TIME LIMIT EXCEEDED-- / 2.003details
#15TIME LIMIT EXCEEDED-- / 2.003details

Code

#include <bits/stdc++.h>

#define ll long long
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define vpii vector<pii>
#define vi vector<int>

using namespace std;

int main() {
	cin.tie(0);
	
	int n,k;
	cin >> n >> k;
	vi ls;
	for(int i=0;i<n;i++) {
		ls.pb(i+1);
	}
	
	do {
		bool isvalid=false;
		int c = 0;
		for(int i=0;i<n;i++) {
			for(int j=i;j<n;j++) {
				if(i==j) continue;
				if(ls[i]>ls[j]) c++;
				if(c==k) {
					isvalid=true;
					break;
				}
			}
			if(isvalid) break;
		} 
		if(isvalid) {
			for(int i=0;i<n;i++) {
				cout << ls[i] << " ";
			}
			break;
		}
	} while(next_permutation(ls.begin(), ls.end()));
		
	return 0;
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
5 0

view   save

correct output
1 2 3 4 5 

view   save

user output
1 2 3 4 5 

view   save

Test 2

Group: 1

Verdict: ACCEPTED

input
5 10

view   save

correct output
5 4 3 2 1 

view   save

user output
5 4 3 2 1 

view   save

Test 3

Group: 1

Verdict: ACCEPTED

input
5 3

view   save

correct output
4 1 2 3 5 

view   save

user output
1 2 5 4 3 

view   save

Test 4

Group: 1

Verdict: ACCEPTED

input
5 1

view   save

correct output
2 1 3 4 5 

view   save

user output
1 2 3 5 4 

view   save

Test 5

Group: 1

Verdict: ACCEPTED

input
5 2

view   save

correct output
3 1 2 4 5 

view   save

user output
1 2 4 5 3 

view   save

Test 6

Group: 2

Verdict: ACCEPTED

input
100 0

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 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
100 4950

view   save

correct output
100 99 98 97 96 95 94 93 92 91...
view   save

user output
(empty)

Test 8

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
100 2279

view   save

correct output
100 99 98 97 96 95 94 93 92 91...
view   save

user output
(empty)

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
100 2528

view   save

correct output
100 99 98 97 96 95 94 93 92 91...
view   save

user output
(empty)

Test 10

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
100 4483

view   save

correct output
100 99 98 97 96 95 94 93 92 91...
view   save

user output
(empty)

Test 11

Group: 3

Verdict: ACCEPTED

input
100000 0

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 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
100000 4999950000

view   save

correct output
100000 99999 99998 99997 99996...
view   save

user output
(empty)

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
100000 2969035543

view   save

correct output
100000 99999 99998 99997 99996...
view   save

user output
(empty)

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
100000 2495939870

view   save

correct output
100000 99999 99998 99997 99996...
view   save

user output
(empty)

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
100000 1279770330

view   save

correct output
100000 99999 99998 99997 99996...
view   save

user output
(empty)