| Task: | Urkupillit |
| Sender: | Ollie |
| Submission time: | 2015-01-29 16:08:16 +0200 |
| Language: | C++ |
| Status: | READY |
| Result: | 12 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 12 |
| #2 | TIME LIMIT EXCEEDED | 0 |
| #3 | TIME LIMIT EXCEEDED | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.05 s | 1 | details |
| #2 | ACCEPTED | 0.06 s | 1 | details |
| #3 | ACCEPTED | 0.06 s | 1 | details |
| #4 | ACCEPTED | 0.05 s | 1 | details |
| #5 | ACCEPTED | 0.06 s | 1 | details |
| #6 | ACCEPTED | 0.05 s | 2 | details |
| #7 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #8 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #9 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #10 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #11 | ACCEPTED | 0.09 s | 3 | details |
| #12 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #13 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #14 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #15 | TIME LIMIT EXCEEDED | -- | 3 | details |
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 |
| correct output |
|---|
| 1 2 3 4 5 |
| user output |
|---|
| 1 2 3 4 5 |
Test 2
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 5 10 |
| correct output |
|---|
| 5 4 3 2 1 |
| user output |
|---|
| 5 4 3 2 1 |
Test 3
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 5 3 |
| correct output |
|---|
| 4 1 2 3 5 |
| user output |
|---|
| 1 2 5 4 3 |
Test 4
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 5 1 |
| correct output |
|---|
| 2 1 3 4 5 |
| user output |
|---|
| 1 2 3 5 4 |
Test 5
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 5 2 |
| correct output |
|---|
| 3 1 2 4 5 |
| user output |
|---|
| 1 2 4 5 3 |
Test 6
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 100 0 |
| correct output |
|---|
| 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| user output |
|---|
| 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
Test 7
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100 4950 |
| correct output |
|---|
| 100 99 98 97 96 95 94 93 92 91... |
| user output |
|---|
| (empty) |
Test 8
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100 2279 |
| correct output |
|---|
| 100 99 98 97 96 95 94 93 92 91... |
| user output |
|---|
| (empty) |
Test 9
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100 2528 |
| correct output |
|---|
| 100 99 98 97 96 95 94 93 92 91... |
| user output |
|---|
| (empty) |
Test 10
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100 4483 |
| correct output |
|---|
| 100 99 98 97 96 95 94 93 92 91... |
| user output |
|---|
| (empty) |
Test 11
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 100000 0 |
| correct output |
|---|
| 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| user output |
|---|
| 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
Test 12
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100000 4999950000 |
| correct output |
|---|
| 100000 99999 99998 99997 99996... |
| user output |
|---|
| (empty) |
Test 13
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100000 2969035543 |
| correct output |
|---|
| 100000 99999 99998 99997 99996... |
| user output |
|---|
| (empty) |
Test 14
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100000 2495939870 |
| correct output |
|---|
| 100000 99999 99998 99997 99996... |
| user output |
|---|
| (empty) |
Test 15
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100000 1279770330 |
| correct output |
|---|
| 100000 99999 99998 99997 99996... |
| user output |
|---|
| (empty) |