— 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-10-31 00:39:24 +0200
Language:C++ (C++17)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.00 s1, 2, 3details
#20.00 s2, 3details
#30.01 s3details
#40.01 s3details
#50.01 s3details
#60.01 s3details
#70.00 s3details
#80.01 s3details
#90.01 s3details
#100.01 s3details
#110.01 s3details
#120.01 s3details
#130.01 s3details
#140.01 s3details
#150.01 s3details
#160.01 s3details
#170.01 s3details
#180.01 s3details
#190.01 s3details
#200.01 s3details

Code

#include <iostream>
#include <list>
#include <algorithm>

using namespace std;
//i fucking HATE c++ for making me do THIS shit!!
bool ListContainsInt(list<int> list, int value)
{
    return std::find(list.begin(), list.end(), value) != list.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];
        }
    }
    list<int> intBlackListArrP1 = {}; //blacklist for other players card, basically.
    //possibly similar needed for other hand? 
    //yes.. here it is.
    list<int> intBlackListArrP2 = {};
    for(int i = 0; i < t; i++){
        intBlackListArrP1.clear();
        intBlackListArrP2.clear();
        int range = cardMatrix[i][0]; //cardMatrix[i][0]; // number of cards. 
        int pointsP1 = cardMatrix[i][1]; //AKA points left.
        int pointsP2 = cardMatrix[i][2]; //handled as points left
        bool swapped = false;
        if(pointsP1 > pointsP2){
            swapped = true;
            int temp = pointsP1;
            pointsP1 = pointsP2;
            pointsP2 = temp;
        }
        if(pointsP1 + pointsP2 > range || (pointsP1 == 0 && pointsP2 != 0) || (pointsP2 != 0 && pointsP1 != 0)){
            std::cout << "NO" << endl;
            continue;
        }
        for(int m = 0; m < range; m++){
            if(pointsP1 == 0 && pointsP2 == 0){
                if(m == 0){
                    std::cout << "YES" << endl;
                    for(int l = 0; l < range; l++){
                        std::cout << l + 1<< " ";
                    }
                    std::cout << "\n";
                    for(int l = 0; l < range; l++){
                        std::cout << l + 1 << " ";
                    }
                    std::cout << "\n";
                    break;
                }
                if(ListContainsInt(intBlackListArrP2, m) || ListContainsInt(intBlackListArrP1, m)){
                        std::cout << "NO" << endl;
                        break;
                }else if (!ListContainsInt(intBlackListArrP2, m) && !ListContainsInt(intBlackListArrP1, m)){
                        if(m == range - 1){
                            intBlackListArrP1.push_front(m);
                            intBlackListArrP2.push_front(m);
                            std::cout << "YES" << endl;
                            for(int l : swapped?intBlackListArrP1:intBlackListArrP2)
                                std::cout << l + 1 << " ";
                            std::cout << "\n";
                            for(int l : swapped?intBlackListArrP2:intBlackListArrP1)
                                std::cout << l + 1 << " ";
                            std::cout << "\n";
                            break;
                        }else{
                            intBlackListArrP1.push_front(m);
                            intBlackListArrP2.push_front(m);
                        }
                }else {
                    std::cout << "NO" << endl;
                    break;
                }
            }
            if(pointsP2 >= pointsP1 && pointsP2 > 0){
                //P2 > P1.
                bool found = false;
                for(int j = 0; j < range; j++){
                    if(found)
                        break;
                    if(!ListContainsInt(intBlackListArrP2, j)){
                        for(int k = j + 1; k < range /*check if - pointsp1 works.*/; k++){
                            if(!ListContainsInt(intBlackListArrP1, k)){
                                intBlackListArrP1.push_front(k); //finds the first option that is bigger than k.
                                intBlackListArrP2.push_front(j);
                                pointsP2--;
                                found = true;
                                break;
                            }
                        }
                    }
                }if(found && m == range - 1){
                    std::cout << "YES" << endl;
                    for(int l : swapped?intBlackListArrP1:intBlackListArrP2)
                        std::cout << l + 1 << " ";
                    std::cout << "\n";
                    for(int l : swapped?intBlackListArrP2:intBlackListArrP1)
                        std::cout << l + 1 << " ";
                    std::cout << "\n";
                    break;
                }
            }
            else if(pointsP1 > pointsP2 && pointsP1 > 0){
                //P1 > P2.
                bool found = false;
                for(int j = 0; j < range; j++){
                    if(found)
                        break;
                    if(!ListContainsInt(intBlackListArrP1, j)){
                        for(int k = j + 1; k < range; k++){
                            if(!ListContainsInt(intBlackListArrP2, k)){
                                pointsP1--;
                                intBlackListArrP2.push_front(k);
                                intBlackListArrP1.push_front(j);
                                found = true;
                                break;
                            }
                        }
                    }
                }if(found && m == range - 1){
                    std::cout << "YES" << endl;
                    for(int l : swapped?intBlackListArrP1:intBlackListArrP2)
                        std::cout << l + 1 << " ";
                    std::cout << "\n";
                    for(int l : swapped?intBlackListArrP2:intBlackListArrP1)
                        std::cout << l + 1 << " ";
                    std::cout << "\n";
                    break;
                }
            }
        }
    }
}

Test details

Test 1

Group: 1, 2, 3

Verdict:

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:

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
NO
NO
NO
...
view save

Test 3

Group: 3

Verdict:

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
NO
NO
NO
NO
NO
...
view save

Test 4

Group: 3

Verdict:

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
NO
NO
NO
NO
...
view save

Test 5

Group: 3

Verdict:

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
NO
NO
NO
NO
NO
...
view save

Test 6

Group: 3

Verdict:

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
NO
NO
NO
...
view save

Test 7

Group: 3

Verdict:

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
NO
NO
NO
NO
NO
...
view save

Test 8

Group: 3

Verdict:

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:

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
NO
NO
NO
NO
NO
...
view save

Test 10

Group: 3

Verdict:

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
NO
NO
NO
NO
...
view save

Test 11

Group: 3

Verdict:

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
NO
NO
NO
NO
NO
...
view save

Test 12

Group: 3

Verdict:

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
NO
NO
NO
...
view save

Test 13

Group: 3

Verdict:

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
NO
NO
NO
...
view save

Test 14

Group: 3

Verdict:

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
NO
NO
NO
NO
...
view save

Test 15

Group: 3

Verdict:

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
NO
...
view save

Test 16

Group: 3

Verdict:

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
NO
NO
NO
...
view save

Test 17

Group: 3

Verdict:

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
NO
NO
NO
...
view save

Test 18

Group: 3

Verdict:

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
NO
...
view save

Test 19

Group: 3

Verdict:

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:

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