답안 #572935

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
572935	2022-06-05T14:09:10 Z	MohamedFaresNebili	Art Collections (BOI22_art)	C++17	20 / 100	143 ms	672 KB

#include <bits/stdc++.h>
#include "art.h"
#include <ext/pb_ds/assoc_container.hpp>

        using namespace std;
        using namespace __gnu_pbds;

        using ll = long long;
        using ii = pair<int, int>;
        using vi = vector<int>;

        #define pb push_back
        #define pp pop_back
        #define ff first
        #define ss second
        #define lb lower_bound
        #define all(x) (x).begin(), (x).end()

        typedef tree<int, null_type, less<int>, rb_tree_tag,
            tree_order_statistics_node_update> indexed_set;

        set<int> merge(set<int> A, set<int> B) {
            if(A.size() < B.size()) swap(A, B);
            for(auto u : B) A.insert(u);
            return A;
        }

        void solve(int N) {
            set<int> adj[N + 1], rev[N + 1]; int income[N + 1]{0};
            for(int l = 1; l <= N; l++) {
                vector<int> R;
                for(int i = 1; i <= N; i++) {
                    if(i == l) continue;
                    R.pb(i);
                }
                R.pb(l); int k = publish(R), p = k;
                for(int i = N - 1; i > 0; i--) {
                    swap(R[i], R[i - 1]);
                    if(adj[l].count(R[i])) {
                        p--; rev[R[i]].insert(l);
                        adj[l] = merge(adj[l], adj[R[i]]);
                        rev[R[i]] = merge(rev[R[i]], rev[l]);
                        continue;
                    }
                    if(rev[l].count(R[i])) {
                        p++; adj[R[i]].insert(l);
                        adj[R[i]] = merge(adj[l], adj[R[i]]);
                        rev[l] = merge(rev[l], rev[R[i]]);
                        continue;
                    }
                    k = publish(R);
                    if(k < p) {
                        adj[l].insert(R[i]);
                        rev[R[i]].insert(l);
                        adj[l] = merge(adj[l], adj[R[i]]);
                        rev[R[i]] = merge(rev[R[i]], rev[l]);
                    }
                    else {
                        adj[R[i]].insert(l);
                        rev[l].insert(R[i]);
                        adj[R[i]] = merge(adj[l], adj[R[i]]);
                        rev[l] = merge(rev[l], rev[R[i]]);
                    }
                    p = k;
                }
            }
            bool vis[N + 1]{0}; vector<int> R; queue<int> q;
            for(int l = 1; l <= N; l++)
                income[l] = adj[l].size();
            for(int l = 1; l <= N; l++) {
                if(income[l]) continue;
                q.push(l); vis[l] = 1;
            }

            while(!q.empty()) {
                int a = q.front(); q.pop(); R.pb(a);
                for(auto u : rev[a]) {
                    income[u] --;
                    if(vis[u] || income[u] != 0) continue;
                    vis[u] = 1; q.push(u);
                }
            }
            reverse(all(R)); answer(R);
        }

Compilation message

interface.cpp: In function 'int publish(std::vector<int>)':
interface.cpp:20:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   20 |     if(v.size() != N) {
      |        ~~~~~~~~~^~~~
interface.cpp: In function 'void answer(std::vector<int>)':
interface.cpp:36:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   36 |     if(v.size() != N) {
      |        ~~~~~~~~~^~~~

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	208 KB	Output is correct
2	Correct	1 ms	208 KB	Output is correct
3	Correct	1 ms	296 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	2 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	1 ms	208 KB	Output is correct

Subtask #2
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	208 KB	Output is correct
2	Correct	1 ms	208 KB	Output is correct
3	Correct	1 ms	296 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	2 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	1 ms	208 KB	Output is correct
8	Correct	1 ms	208 KB	Output is correct
9	Correct	9 ms	336 KB	Output is correct
10	Correct	10 ms	336 KB	Output is correct
11	Correct	11 ms	336 KB	Output is correct
12	Correct	14 ms	336 KB	Output is correct
13	Correct	1 ms	208 KB	Output is correct
14	Correct	1 ms	208 KB	Output is correct
15	Correct	1 ms	208 KB	Output is correct
16	Correct	6 ms	208 KB	Output is correct
17	Correct	1 ms	336 KB	Output is correct
18	Correct	1 ms	208 KB	Output is correct
19	Correct	15 ms	344 KB	Output is correct
20	Correct	15 ms	336 KB	Output is correct

Subtask #3
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	208 KB	Output is correct
2	Correct	1 ms	208 KB	Output is correct
3	Correct	1 ms	296 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	2 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	1 ms	208 KB	Output is correct
8	Correct	1 ms	208 KB	Output is correct
9	Correct	9 ms	336 KB	Output is correct
10	Correct	10 ms	336 KB	Output is correct
11	Correct	11 ms	336 KB	Output is correct
12	Correct	14 ms	336 KB	Output is correct
13	Correct	1 ms	208 KB	Output is correct
14	Correct	1 ms	208 KB	Output is correct
15	Correct	1 ms	208 KB	Output is correct
16	Correct	6 ms	208 KB	Output is correct
17	Correct	1 ms	336 KB	Output is correct
18	Correct	1 ms	208 KB	Output is correct
19	Correct	15 ms	344 KB	Output is correct
20	Correct	15 ms	336 KB	Output is correct
21	Correct	0 ms	208 KB	Output is correct
22	Correct	9 ms	336 KB	Output is correct
23	Correct	10 ms	336 KB	Output is correct
24	Correct	8 ms	376 KB	Output is correct
25	Correct	9 ms	336 KB	Output is correct
26	Incorrect	143 ms	672 KB	Not correct
27	Halted	0 ms	0 KB	-

Subtask #4
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	208 KB	Output is correct
2	Correct	1 ms	208 KB	Output is correct
3	Correct	1 ms	296 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	2 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	1 ms	208 KB	Output is correct
8	Correct	1 ms	208 KB	Output is correct
9	Correct	9 ms	336 KB	Output is correct
10	Correct	10 ms	336 KB	Output is correct
11	Correct	11 ms	336 KB	Output is correct
12	Correct	14 ms	336 KB	Output is correct
13	Correct	1 ms	208 KB	Output is correct
14	Correct	1 ms	208 KB	Output is correct
15	Correct	1 ms	208 KB	Output is correct
16	Correct	6 ms	208 KB	Output is correct
17	Correct	1 ms	336 KB	Output is correct
18	Correct	1 ms	208 KB	Output is correct
19	Correct	15 ms	344 KB	Output is correct
20	Correct	15 ms	336 KB	Output is correct
21	Correct	0 ms	208 KB	Output is correct
22	Correct	9 ms	336 KB	Output is correct
23	Correct	10 ms	336 KB	Output is correct
24	Correct	8 ms	376 KB	Output is correct
25	Correct	9 ms	336 KB	Output is correct
26	Incorrect	143 ms	672 KB	Not correct
27	Halted	0 ms	0 KB	-

Subtask #5
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	208 KB	Output is correct
2	Correct	1 ms	208 KB	Output is correct
3	Correct	1 ms	296 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	2 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	1 ms	208 KB	Output is correct
8	Correct	1 ms	208 KB	Output is correct
9	Correct	9 ms	336 KB	Output is correct
10	Correct	10 ms	336 KB	Output is correct
11	Correct	11 ms	336 KB	Output is correct
12	Correct	14 ms	336 KB	Output is correct
13	Correct	1 ms	208 KB	Output is correct
14	Correct	1 ms	208 KB	Output is correct
15	Correct	1 ms	208 KB	Output is correct
16	Correct	6 ms	208 KB	Output is correct
17	Correct	1 ms	336 KB	Output is correct
18	Correct	1 ms	208 KB	Output is correct
19	Correct	15 ms	344 KB	Output is correct
20	Correct	15 ms	336 KB	Output is correct
21	Correct	0 ms	208 KB	Output is correct
22	Correct	9 ms	336 KB	Output is correct
23	Correct	10 ms	336 KB	Output is correct
24	Correct	8 ms	376 KB	Output is correct
25	Correct	9 ms	336 KB	Output is correct
26	Incorrect	143 ms	672 KB	Not correct
27	Halted	0 ms	0 KB	-

Subtask #6
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	208 KB	Output is correct
2	Correct	1 ms	208 KB	Output is correct
3	Correct	1 ms	296 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	2 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	1 ms	208 KB	Output is correct
8	Correct	1 ms	208 KB	Output is correct
9	Correct	9 ms	336 KB	Output is correct
10	Correct	10 ms	336 KB	Output is correct
11	Correct	11 ms	336 KB	Output is correct
12	Correct	14 ms	336 KB	Output is correct
13	Correct	1 ms	208 KB	Output is correct
14	Correct	1 ms	208 KB	Output is correct
15	Correct	1 ms	208 KB	Output is correct
16	Correct	6 ms	208 KB	Output is correct
17	Correct	1 ms	336 KB	Output is correct
18	Correct	1 ms	208 KB	Output is correct
19	Correct	15 ms	344 KB	Output is correct
20	Correct	15 ms	336 KB	Output is correct
21	Correct	0 ms	208 KB	Output is correct
22	Correct	9 ms	336 KB	Output is correct
23	Correct	10 ms	336 KB	Output is correct
24	Correct	8 ms	376 KB	Output is correct
25	Correct	9 ms	336 KB	Output is correct
26	Incorrect	143 ms	672 KB	Not correct
27	Halted	0 ms	0 KB	-

답안 #572935

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 15.0 / 15.0

Subtask #3 0 / 15.0

Subtask #4 0 / 15.0

Subtask #5 0 / 20.0

Subtask #6 0 / 30.0

Subtask #1
5.0 / 5.0

Subtask #2
15.0 / 15.0

Subtask #3
0 / 15.0

Subtask #4
0 / 15.0

Subtask #5
0 / 20.0

Subtask #6
0 / 30.0