| Task: | Urkupillit |
| Sender: | Dentosal |
| Submission time: | 2015-01-29 14:52:46 +0200 |
| Language: | C++ |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | TIME LIMIT EXCEEDED | 0 |
| #2 | TIME LIMIT EXCEEDED | 0 |
| #3 | RUNTIME ERROR | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.06 s | 1 | details |
| #2 | TIME LIMIT EXCEEDED | -- | 1 | details |
| #3 | WRONG ANSWER | 0.06 s | 1 | details |
| #4 | ACCEPTED | 0.06 s | 1 | details |
| #5 | WRONG ANSWER | 0.05 s | 1 | details |
| #6 | ACCEPTED | 0.07 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 | RUNTIME ERROR | 0.77 s | 3 | details |
| #12 | RUNTIME ERROR | 0.66 s | 3 | details |
| #13 | RUNTIME ERROR | 0.52 s | 3 | details |
| #14 | RUNTIME ERROR | 0.54 s | 3 | details |
| #15 | RUNTIME ERROR | 0.54 s | 3 | details |
Code
#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
unsigned int urut[5000];
unsigned int n;
unsigned int k;
inline bool isDone() {
unsigned int pairs=0;
if (n<2) {return 0;}
for (unsigned int i=1; i<n; ++i) {
if (urut[i-1]>urut[i]) {
++pairs;
}
}
return (pairs==k);
}
int main() {
cin >> n;
cin >> k;
for (unsigned int i = 0; i < n; ++i) {
urut[i] = i+1;
}
while (!isDone()) {
next_permutation(urut, urut+n);
}
for (unsigned int i=0; i<n; ++i){cout << urut[i] << " ";}
cout << endl;
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: TIME LIMIT EXCEEDED
| input |
|---|
| 5 10 |
| correct output |
|---|
| 5 4 3 2 1 |
| user output |
|---|
| (empty) |
Test 3
Group: 1
Verdict: WRONG ANSWER
| input |
|---|
| 5 3 |
| correct output |
|---|
| 4 1 2 3 5 |
| user output |
|---|
| 1 5 4 3 2 |
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: WRONG ANSWER
| input |
|---|
| 5 2 |
| correct output |
|---|
| 3 1 2 4 5 |
| user output |
|---|
| 1 2 5 4 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: RUNTIME ERROR
| input |
|---|
| 100000 0 |
| correct output |
|---|
| 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| user output |
|---|
| (empty) |
Test 12
Group: 3
Verdict: RUNTIME ERROR
| input |
|---|
| 100000 4999950000 |
| correct output |
|---|
| 100000 99999 99998 99997 99996... |
| user output |
|---|
| (empty) |
Test 13
Group: 3
Verdict: RUNTIME ERROR
| input |
|---|
| 100000 2969035543 |
| correct output |
|---|
| 100000 99999 99998 99997 99996... |
| user output |
|---|
| (empty) |
Test 14
Group: 3
Verdict: RUNTIME ERROR
| input |
|---|
| 100000 2495939870 |
| correct output |
|---|
| 100000 99999 99998 99997 99996... |
| user output |
|---|
| (empty) |
Test 15
Group: 3
Verdict: RUNTIME ERROR
| input |
|---|
| 100000 1279770330 |
| correct output |
|---|
| 100000 99999 99998 99997 99996... |
| user output |
|---|
| (empty) |