— Dark mode

Datatähti 2025 alku

Kortit I

  • Start: 2024-10-28 00:00:00
  • End: 2024-11-11 00:00:00
Submission details
Task:Kortit I
Sender:urkkiz
Submission time:2024-11-07 13:57:34 +0200
Language:C++ (C++17)
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED12
#2ACCEPTED15
#3ACCEPTED73
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2, 3details
#2ACCEPTED0.00 s2, 3details
#3ACCEPTED0.01 s3details
#4ACCEPTED0.01 s3details
#5ACCEPTED0.01 s3details
#6ACCEPTED0.01 s3details
#7ACCEPTED0.01 s3details
#8ACCEPTED0.01 s3details
#9ACCEPTED0.01 s3details
#10ACCEPTED0.01 s3details
#11ACCEPTED0.01 s3details
#12ACCEPTED0.01 s3details
#13ACCEPTED0.01 s3details
#14ACCEPTED0.01 s3details
#15ACCEPTED0.01 s3details
#16ACCEPTED0.02 s3details
#17ACCEPTED0.01 s3details
#18ACCEPTED0.01 s3details
#19ACCEPTED0.01 s3details
#20ACCEPTED0.01 s3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:36:13: warning: unused variable 'possibilities' [-Wunused-variable]
   36 |         int possibilities = 0;
      |             ^~~~~~~~~~~~~

Code

#include<iostream>
#include<unordered_set>
#include<map>

using namespace std;
bool unorderedSetContainsInt(unordered_set<int> set, int val){
    return set.find(val) != set.end();
}
int main(){
    int t;
    cin >> t;
    int cardMatrix[t][3];
    for(int i = 0; i < t; i++){
        for(int j = 0; j < 3; j++){
            cin >> cardMatrix[i][j];
        }
    }
    unordered_set<int> intBlackListArrP1 = {};
    unordered_set<int> intBlackListArrP2 = {};
    for(int i = 0; i < t; i++){
        intBlackListArrP1.clear();
        intBlackListArrP2.clear();
        int arrOne[cardMatrix[i][0]];
        int arrTwo[cardMatrix[i][0]];
        int range = cardMatrix[i][0];
        int pointsP1 = cardMatrix[i][1];
        int pointsP2 = cardMatrix[i][2];
        for(int jshjkhj = 0; jshjkhj < cardMatrix[i][0]; jshjkhj++){
            arrOne[jshjkhj] = jshjkhj;
            arrTwo[jshjkhj] = jshjkhj;
        }
        if(pointsP1 + pointsP2 > range || (pointsP1 == 0 && pointsP2 != 0) || (pointsP2 == 0 && pointsP1 != 0)){
            std::cout << "NO" << endl;
            continue;
        }
        int possibilities = 0;
        bool found = false;
        for(int j = 0; j < range; j++){
            found = false;
            if(pointsP1 == 0 && pointsP2 == 0){
                found = true;
                break;
            }
            if(j + pointsP1 + pointsP2 > range){
                std::cout<<"NO"<<endl;
                break;
            }

            if(pointsP1 >= pointsP2){
                for(int m = 0; m < range; m++){
                    if(pointsP1 == pointsP2){
                        if(arrOne[range-(m+1)] > arrTwo[j]){
                            int temp = arrOne[j];
                            arrOne[j] = arrOne[range-(m+1)];
                            arrOne[range-(m+1)] = temp;
                            pointsP1--;
                            pointsP2--;
                            break;
                        }
                    }else{
                        if(arrOne[m] > arrTwo[j] && arrOne[m] > arrTwo[j]){
                            int temp = arrOne[j];
                            arrOne[j] = arrOne[m];
                            arrOne[m] = temp;
                            pointsP1--;
                            break;
                        }
                    }
                    
                }
           }else if(pointsP2 > pointsP1){
            for(int m = 0; m < range; m++){
                    if(arrTwo[m] > arrOne[j] && arrTwo[m] > arrOne[j]){
                        int temp = arrTwo[j];
                        arrTwo[j] = arrTwo[m];
                        arrTwo[m] = temp;
                        pointsP2--;
                        break;
                    }
                }
           }
        }
        if(found){
            std::cout << "YES" << endl;
            for(int l : arrOne)
                std::cout << l + 1 << " ";
            std::cout << "\n";
            for(int l : arrTwo)
                std::cout << l + 1 << " ";
            std::cout << "\n";
        }
        
    }
}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
54
4 4 0
3 1 3
3 2 2
4 0 4
...
view save

correct output
NO
NO
NO
NO
NO
...
view save

user output
NO
NO
NO
NO
NO
...
view save

Test 2

Group: 2, 3

Verdict: ACCEPTED

input
284
6 1 0
5 0 2
7 1 5
7 7 5
...
view save

correct output
NO
NO
YES
1 2 3 4 5 6 7 
2 3 4 5 6 1 7 
...
view save

user output
NO
NO
YES
1 2 3 4 7 6 5 
2 3 4 5 1 6 7 
...
view save

Test 3

Group: 3

Verdict: ACCEPTED

input
955
14 2 10
12 2 5
10 4 9
14 1 13
...
view save

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

user output
YES
1 2 3 4 5 6 7 8 14 13 11 12 10...
view save

Test 4

Group: 3

Verdict: ACCEPTED

input
869
17 12 9
16 8 4
15 9 9
17 11 15
...
view save

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

user output
NO
YES
2 3 4 5 16 15 14 13 9 10 11 12...
view save

Test 5

Group: 3

Verdict: ACCEPTED

input
761
18 3 15
19 1 15
18 8 1
19 19 17
...
view save

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

user output
YES
1 2 3 4 5 6 7 8 9 10 11 12 18 ...
view save

Test 6

Group: 3

Verdict: ACCEPTED

input
925
21 14 21
20 18 18
20 7 6
21 14 9
...
view save

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

user output
NO
NO
YES
2 20 19 18 17 16 15 8 9 10 11 ...
view save

Test 7

Group: 3

Verdict: ACCEPTED

input
529
22 3 3
22 17 5
22 6 15
22 22 20
...
view save

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

user output
YES
22 21 20 4 5 6 7 8 9 10 11 12 ...
view save

Test 8

Group: 3

Verdict: ACCEPTED

input
576
23 18 9
23 16 8
23 16 13
23 16 22
...
view save

correct output
NO
NO
NO
NO
NO
...
view save

user output
NO
NO
NO
NO
NO
...
view save

Test 9

Group: 3

Verdict: ACCEPTED

input
625
24 2 22
24 15 21
24 6 3
24 21 1
...
view save

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

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

Test 10

Group: 3

Verdict: ACCEPTED

input
676
25 16 25
25 15 2
25 15 7
25 15 16
...
view save

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

user output
NO
YES
2 3 4 5 6 7 8 9 10 11 12 13 14...
view save

Test 11

Group: 3

Verdict: ACCEPTED

input
729
26 2 18
26 14 18
26 5 18
26 19 13
...
view save

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

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

Test 12

Group: 3

Verdict: ACCEPTED

input
784
27 26 7
27 14 0
27 14 5
27 14 14
...
view save

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

user output
NO
NO
YES
2 3 4 5 6 7 8 9 10 27 26 25 24...
view save

Test 13

Group: 3

Verdict: ACCEPTED

input
841
28 26 16
28 13 19
28 5 8
28 26 4
...
view save

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

user output
NO
NO
YES
1 2 3 28 27 26 25 24 9 10 11 1...
view save

Test 14

Group: 3

Verdict: ACCEPTED

input
900
29 24 15
29 13 2
29 13 7
29 13 16
...
view save

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

user output
NO
YES
2 3 4 5 6 7 8 9 10 11 12 29 28...
view save

Test 15

Group: 3

Verdict: ACCEPTED

input
961
30 24 26
30 12 24
30 4 29
30 24 14
...
view save

correct output
NO
NO
NO
NO
YES
...
view save

user output
NO
NO
NO
NO
YES
...
view save

Test 16

Group: 3

Verdict: ACCEPTED

input
1000
15 12 6
33 18 30
44 4 26
6 6 5
...
view save

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

user output
NO
NO
YES
1 2 3 4 5 6 7 8 9 10 11 12 13 ...
view save

Test 17

Group: 3

Verdict: ACCEPTED

input
1000
45 32 30
4 0 3
46 23 10
71 19 46
...
view save

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

user output
NO
NO
YES
2 3 4 5 6 7 8 9 10 11 12 13 14...
view save

Test 18

Group: 3

Verdict: ACCEPTED

input
1000
51 29 37
75 11 72
5 2 4
31 8 26
...
view save

correct output
NO
NO
NO
NO
YES
...
view save

user output
NO
NO
NO
NO
YES
...
view save

Test 19

Group: 3

Verdict: ACCEPTED

input
1000
50 20 37
99 45 58
86 79 73
85 70 54
...
view save

correct output
NO
NO
NO
NO
NO
...
view save

user output
NO
NO
NO
NO
NO
...
view save

Test 20

Group: 3

Verdict: ACCEPTED

input
1000
26 23 5
73 53 59
64 47 41
80 75 55
...
view save

correct output
NO
NO
NO
NO
NO
...
view save

user output
NO
NO
NO
NO
NO
...
view save

Tasks

A Pizzat-B Robotti-C Kortit I-D Kortit II-E Niitty-F Tikut-

Submissions (urkkiz)

2024-11-11 00:00:00 1002024-11-07 13:57:34 1002024-10-31 00:40:34 1002024-10-31 00:39:24 02024-10-31 00:34:42 02024-10-31 00:30:32 02024-10-31 00:16:03 02024-10-31 00:15:39 02024-10-31 00:11:42 02024-10-31 00:11:11 0