Submission #1013052

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1013052	2024-07-03T06:40:04 Z	vjudge1	Slagalica (COCI19_slagalica2)	C++17	35 / 70	53 ms	3992 KB

slagalica

#include <bits/stdc++.h>
using namespace std;

int main(){
    int n;
    cin >> n;

    vector<int> vec[10], g[10];
    for (int i = 0; i < n; i ++){
        int x, y;
        cin >> x >> y;
        vec[x].push_back(y);
    }
    for (int i = 1; i <= 8; i ++)
        sort(vec[i].rbegin(), vec[i].rend());

    g[5] = {3, 4};
    g[6] = {1, 2};
    g[1] = {3, 4};
    g[2] = {1, 2};
    g[3] = {3, 4};
    g[4] = {1, 2};

    vector<int> answer, types;
    for (int x : vec[5]){
        answer.push_back(x);
        types.push_back(5);
    }
    for (int x : vec[6]){
        answer.push_back(x);
        types.push_back(6);
    }

    while (1){
        int last = types.back();
        int min_t = -1;
        for (int t : g[last]){
            if (t == 1 and vec[1].size() == 1 and vec[2].size() > 0) continue;
            if (vec[t].size() and (min_t == -1 or vec[min_t].back() > vec[t].back()))
                min_t = t;
        }

        bool all = 1;
        for (int i = 1; i <= 4; i ++)
            all &= (vec[i].size() == 0);
        if (all) break;

        if (!all and min_t == -1){
            cout << -1 << endl;
            return 0;
        } 

        types.push_back(min_t);
        answer.push_back(vec[min_t].back());
        vec[min_t].pop_back();
    }

    int last = types.back();
    int have = 7;
    if (vec[8].size()) have = 8;

    if ((have == 7 and (last == 2 or last == 4)) or (have == 8 and (last == 1 or last == 3)))
        answer.push_back(vec[have][0]);
    else{
        cout << -1 << endl;
        return 0;
    }

    for (int x : answer)
        cout << x << " ";
    cout << endl;
}

Subtask #1
0 / 5.0

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Correct	344 KB	Output is correct
3	Incorrect	348 KB	Output isn't correct
4	Halted	0 KB	-

Subtask #2
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	348 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #3
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	42 ms	3604 KB	Output is correct
2	Correct	36 ms	2720 KB	Output is correct

Subtask #4
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	41 ms	3384 KB	Output is correct
2	Correct	35 ms	2724 KB	Output is correct

Subtask #5
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	40 ms	2508 KB	Output is correct
2	Correct	41 ms	3312 KB	Output is correct

Subtask #6
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	32 ms	2276 KB	Output is correct
2	Correct	39 ms	3484 KB	Output is correct
3	Correct	48 ms	3992 KB	Output is correct

Subtask #7
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	33 ms	2256 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #8
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	37 ms	3528 KB	Output is correct
2	Correct	34 ms	2288 KB	Output is correct
3	Incorrect	36 ms	2876 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

Subtask #9
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	34 ms	2768 KB	Output is correct
2	Correct	53 ms	3720 KB	Output is correct

Subtask #10
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	41 ms	3000 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #11
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	33 ms	2676 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #12
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	45 ms	3756 KB	Output is correct
2	Correct	37 ms	2896 KB	Output is correct

Subtask #13
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	37 ms	3424 KB	Output is correct
2	Correct	34 ms	2860 KB	Output is correct

Subtask #14
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	37 ms	2756 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Submission #1013052

Compilation message