Submission details
Task:Rodent's Revenge
Sender:thierry
Submission time:2018-09-20 18:01:02 +0300
Language:Java
Status:READY
Result:ACCEPTED
Test results
testverdicttime
#1ACCEPTED0.14 sdetails
#2ACCEPTED0.23 sdetails
#3ACCEPTED0.22 sdetails
#4ACCEPTED0.21 sdetails
#5ACCEPTED0.23 sdetails
#6ACCEPTED0.21 sdetails
#7ACCEPTED0.53 sdetails
#8ACCEPTED0.57 sdetails
#9ACCEPTED0.54 sdetails
#10ACCEPTED0.57 sdetails
#11ACCEPTED0.56 sdetails
#12ACCEPTED0.56 sdetails
#13ACCEPTED0.57 sdetails
#14ACCEPTED0.54 sdetails
#15ACCEPTED0.57 sdetails
#16ACCEPTED0.58 sdetails

Code

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;

class Viikko3_d {

    static class FastReader {

        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
            }
            return str;
        }
    }

    public static void main(String[] args) {

        FastReader s = new FastReader();
        int n = s.nextInt();
        int k = s.nextInt();

        int[] list = new int[n];

        if (n / 2 >= k) {
            metodi(n, k, list);
        } else {
            metodi(n, (n - k - 1), list);
            for (int i = 0; i < n / 2; i++) {
                int temp = list[i];
                list[i] = list[n - i - 1];
                list[n - i - 1] = temp;
            }
        }
        System.out.print(list[0]);
        for (int i = 1; i < n; i++) {
            System.out.print(" " + list[i]);
        }
    }

    private static void metodi(int n, int k, int[] list) {
        int a = 0;
        for (int i = 0; i < n; i++) {
            if (k - a > 0) {
                if (i % 2 == 0) {
                    list[i] = i + 2;
                } else {
                    list[i] = i;
                    a++;
                }
            } else {
                list[i] = i + 1;
            }
        }
    }

}

Test details

Test 1

Verdict: ACCEPTED

input
1 0

correct output

user output
1

Test 2

Verdict: ACCEPTED

input
2 0

correct output
1 2 

user output
1 2

Test 3

Verdict: ACCEPTED

input
2 1

correct output
2 1 

user output
2 1

Test 4

Verdict: ACCEPTED

input
3 0

correct output
1 2 3 

user output
1 2 3

Test 5

Verdict: ACCEPTED

input
3 1

correct output
1 3 2 

user output
2 1 3

Test 6

Verdict: ACCEPTED

input
3 2

correct output
3 2 1 

user output
3 2 1

Test 7

Verdict: ACCEPTED

input
99999 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 ...
Truncated

Test 8

Verdict: ACCEPTED

input
99999 123

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
2 1 4 3 6 5 8 7 10 9 12 11 14 ...
Truncated

Test 9

Verdict: ACCEPTED

input
99999 12345

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
2 1 4 3 6 5 8 7 10 9 12 11 14 ...
Truncated

Test 10

Verdict: ACCEPTED

input
99999 99998

correct output
99999 99998 99997 99996 99995 ...

user output
99999 99998 99997 99996 99995 ...
Truncated

Test 11

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 ...
Truncated

Test 12

Verdict: ACCEPTED

input
100000 1

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

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

Test 13

Verdict: ACCEPTED

input
100000 123

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
2 1 4 3 6 5 8 7 10 9 12 11 14 ...
Truncated

Test 14

Verdict: ACCEPTED

input
100000 12345

correct output
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
2 1 4 3 6 5 8 7 10 9 12 11 14 ...
Truncated

Test 15

Verdict: ACCEPTED

input
100000 99998

correct output
1 100000 99999 99998 99997 999...

user output
100000 99999 99998 99997 99996...
Truncated

Test 16

Verdict: ACCEPTED

input
100000 99999

correct output
100000 99999 99998 99997 99996...

user output
100000 99999 99998 99997 99996...
Truncated