CSES - KILO 2018 5/5 - Results
Submission details
Task:Criminals
Sender:madwarge
Submission time:2018-10-04 16:57:19 +0300
Language:Java
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.22 sdetails
#2ACCEPTED0.23 sdetails
#3ACCEPTED0.23 sdetails
#4ACCEPTED0.21 sdetails
#5ACCEPTED0.22 sdetails
#6ACCEPTED0.22 sdetails
#70.22 sdetails
#80.22 sdetails
#90.31 sdetails
#100.30 sdetails
#110.26 sdetails
#12ACCEPTED0.29 sdetails
#130.32 sdetails
#140.30 sdetails
#15ACCEPTED0.32 sdetails
#16ACCEPTED0.32 sdetails
#170.32 sdetails
#18ACCEPTED0.32 sdetails
#190.31 sdetails

Code

//package kilpaohjelmointi;

import java.util.ArrayList;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;


public class Kilpaohjelmointi {
  
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int n = s.nextInt();
        s.nextLine();
        Set<String> set = new HashSet<>();
        ArrayList<String> kaikki = new ArrayList<>();

        boolean pilalla = false;
        for (int i = 0; i < n; i++) {
            String str = s.nextLine();
            if(kaikki.contains(str)) {
                pilalla = true;
            }
            kaikki.add(str);
            String[] palat = str.split("-");
            set.add(palat[0]);
            
            boolean[] used = new boolean[3];
            
            for (int j = 0; j < 3; j++) {
                for (int k = 0; k < 3; k++) {
                    if(palat[1].charAt(j) == palat[0].charAt(k)) {
                        used[k] = true;
                        break;
                    }
                } 
            }
            
            for (int j = 0; j < used.length; j++) {
                if(used[j] == false) {
                    pilalla = true;
                }
            }
        }
        
        if(pilalla) {
            System.out.println("QAQ");
        } else {
            System.out.println(set.size());
        }
        
        
    }
    
}

Test details

Test 1

Verdict: ACCEPTED

input
5
176-671
176-617
176-716
176-167
...

correct output
1

user output
1

Test 2

Verdict: ACCEPTED

input
3
123-321
123-312
312-123

correct output
2

user output
2

Test 3

Verdict: ACCEPTED

input
2
123-123
123-123

correct output
QAQ

user output
QAQ

Test 4

Verdict: ACCEPTED

input
2
123-123
123-456

correct output
QAQ

user output
QAQ

Test 5

Verdict: ACCEPTED

input
1
514-415

correct output
1

user output
1

Test 6

Verdict: ACCEPTED

input
8
384-843
384-348
384-834
895-958
...

correct output
3

user output
3

Test 7

Verdict:

input
9
548-845
556-565
626-266
548-458
...

correct output
3

user output
QAQ

Test 8

Verdict:

input
1
966-696

correct output
1

user output
QAQ

Test 9

Verdict:

input
860
883-838
589-895
172-712
591-951
...

correct output
254

user output
QAQ

Test 10

Verdict:

input
766
869-968
486-468
295-925
166-616
...

correct output
265

user output
QAQ

Test 11

Verdict:

input
128
219-912
444-444
372-327
771-771
...

correct output
82

user output
QAQ

Test 12

Verdict: ACCEPTED

input
392
625-625
129-291
451-451
277-772
...

correct output
QAQ

user output
QAQ

Test 13

Verdict:

input
868
689-869
737-773
896-689
522-225
...

correct output
222

user output
QAQ

Test 14

Verdict:

input
533
548-485
143-143
714-471
299-299
...

correct output
295

user output
QAQ

Test 15

Verdict: ACCEPTED

input
1000
128-182
755-755
196-169
674-476
...

correct output
QAQ

user output
QAQ

Test 16

Verdict: ACCEPTED

input
1000
365-635
476-746
199-919
648-468
...

correct output
QAQ

user output
QAQ

Test 17

Verdict:

input
1000
474-744
428-284
532-235
288-288
...

correct output
425

user output
QAQ

Test 18

Verdict: ACCEPTED

input
1000
346-436
573-735
981-918
582-582
...

correct output
QAQ

user output
QAQ

Test 19

Verdict:

input
1000
128-128
585-558
487-874
261-162
...

correct output
208

user output
QAQ