oj.uz

Submission #1062259

# Submission time Handle Problem Language Result Execution time Memory
1062259 2024-08-16T22:56:43 Z wood Connecting Supertrees (IOI20_supertrees) C++17
21 / 100
 192 ms 22100 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int,int> p32;
typedef pair<ll,ll> p64;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define vi vector<int>
#define vp32 vector<p32>
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define MOD %1000000007
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <class T>
using Tree =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//never guess
//never debug without reviewing code
//never try adding ones or substracting them
//only step by step debug when necessay



int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
    vector<vi> res(n,vi(n));
    int leader[n]; for(int i = 0; i<n; i++) leader[i] = i;
    bool done[n]; memset(done,0,sizeof done);
    for(int i = 0; i<n; i++){
        if(done[i])continue;
        done[i] = true;
        set<int> zeros, ones, twos;
        for(int j = 0; j<n; j++){
            if(p[i][j]==0) zeros.insert(j);
            else if(p[i][j]==1){
              ones.insert(j);
              done[j] = true;
            }
            else twos.insert(j);
        }
        for(int x : ones){
            for(int j = 0; j<n; j++)
                if((p[x][j]==0&&!zeros.count(j))||(p[x][j]==1&&!ones.count(j))||(p[x][j]==2&&!twos.count(j))) return 0;
        }
        vi comp(ones.begin(),ones.end());
        for(int j = 0; j<comp.size()-1; j++){
            int a = comp[j], b = comp[j+1];
            res[a][b] = res[b][a] = 1;
            leader[b] = i;
        }
    }
    memset(done,0,sizeof done);
    for(int ii = 0; ii<n; ii++){
        int i = leader[ii];
        if(done[i]) continue;
        done[i] = true;
        set<int> t = {i};
        for(int k = 0; k<n; k++){
            int j = leader[k];
            if(p[i][j]==2) t.insert(j);
            done[j] = true;
        }
        if(t.size()==2) return 0;
        if(t.size()<=1) continue;
        for(int x : t){
            for(int k = 0; k<n; k++){
                int j = leader[k];
                if((p[x][j]==2&&!t.count(j))||(p[x][j]==0&&t.count(j))) return 0;
            }
        }
        vi comp(t.begin(),t.end());
        for(int j = 0; j<comp.size()-1; j++){
            int a = comp[j], b = comp[j+1];
            res[a][b] = res[b][a] = 1;
        }
        int a = comp[0], b = comp[comp.size()-1];
        res[a][b] = res[b][a] = 1;
    }
    build(res);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:50:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |         for(int j = 0; j<comp.size()-1; j++){
      |                        ~^~~~~~~~~~~~~~
supertrees.cpp:76:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |         for(int j = 0; j<comp.size()-1; j++){
      |                        ~^~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1116 KB Output is correct
7 Correct 124 ms 22100 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1116 KB Output is correct
7 Correct 124 ms 22100 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1116 KB Output is correct
13 Correct 192 ms 22052 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 53 ms 12292 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 32 ms 5756 KB Output is correct
21 Correct 138 ms 22004 KB Output is correct
22 Correct 152 ms 22024 KB Output is correct
23 Correct 156 ms 22040 KB Output is correct
24 Correct 185 ms 22040 KB Output is correct
25 Correct 55 ms 12112 KB Output is correct
26 Correct 49 ms 12112 KB Output is correct
27 Correct 129 ms 22044 KB Output is correct
28 Correct 186 ms 22040 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 7 ms 1116 KB Output is correct
9 Correct 186 ms 22016 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1288 KB Output is correct
13 Correct 182 ms 22040 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 436 KB Output is correct
16 Correct 8 ms 860 KB Output is correct
17 Correct 153 ms 14084 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Incorrect 45 ms 6236 KB Too few ways to get from 1 to 17, should be 2 found 0
22 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 33 ms 5720 KB Output is correct
5 Correct 130 ms 22096 KB Output is correct
6 Correct 147 ms 22100 KB Output is correct
7 Correct 127 ms 22100 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Incorrect 44 ms 5788 KB Too few ways to get from 1 to 17, should be 2 found 0
10 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1116 KB Output is correct
7 Correct 124 ms 22100 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1116 KB Output is correct
13 Correct 192 ms 22052 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 53 ms 12292 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 32 ms 5756 KB Output is correct
21 Correct 138 ms 22004 KB Output is correct
22 Correct 152 ms 22024 KB Output is correct
23 Correct 156 ms 22040 KB Output is correct
24 Correct 185 ms 22040 KB Output is correct
25 Correct 55 ms 12112 KB Output is correct
26 Correct 49 ms 12112 KB Output is correct
27 Correct 129 ms 22044 KB Output is correct
28 Correct 186 ms 22040 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 7 ms 1116 KB Output is correct
37 Correct 186 ms 22016 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 7 ms 1288 KB Output is correct
41 Correct 182 ms 22040 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 1 ms 436 KB Output is correct
44 Correct 8 ms 860 KB Output is correct
45 Correct 153 ms 14084 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Incorrect 45 ms 6236 KB Too few ways to get from 1 to 17, should be 2 found 0
50 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1116 KB Output is correct
7 Correct 124 ms 22100 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1116 KB Output is correct
13 Correct 192 ms 22052 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 53 ms 12292 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 32 ms 5756 KB Output is correct
21 Correct 138 ms 22004 KB Output is correct
22 Correct 152 ms 22024 KB Output is correct
23 Correct 156 ms 22040 KB Output is correct
24 Correct 185 ms 22040 KB Output is correct
25 Correct 55 ms 12112 KB Output is correct
26 Correct 49 ms 12112 KB Output is correct
27 Correct 129 ms 22044 KB Output is correct
28 Correct 186 ms 22040 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 7 ms 1116 KB Output is correct
37 Correct 186 ms 22016 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 7 ms 1288 KB Output is correct
41 Correct 182 ms 22040 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 1 ms 436 KB Output is correct
44 Correct 8 ms 860 KB Output is correct
45 Correct 153 ms 14084 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Incorrect 45 ms 6236 KB Too few ways to get from 1 to 17, should be 2 found 0
50 Halted 0 ms 0 KB -