oj.uz

Submission #1062247

# Submission time Handle Problem Language Result Execution time Memory
1062247 2024-08-16T22:42:00 Z wood Connecting Supertrees (IOI20_supertrees) C++17
21 / 100
 178 ms 22352 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[j+1] = 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;
        for(int j = 0; j<n; j++){
            if(p[i][j]==2) t.insert(j);
        }
        if(t.size()==2) return 0;
        for(int x : t){
            for(int j = 0; j<n; j++){
                if((p[i][j]==2&&!t.count(j))||(p[i][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;
       //     leader[j+1] = i;
       // }
       // int a = comp[0], b = comp[n-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:66:17: warning: unused variable 'x' [-Wunused-variable]
   66 |         for(int x : t){
      |                 ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 8 ms 1108 KB Output is correct
7 Correct 131 ms 22036 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 8 ms 1108 KB Output is correct
7 Correct 131 ms 22036 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 344 KB Output is correct
12 Correct 13 ms 1116 KB Output is correct
13 Correct 178 ms 22100 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 860 KB Output is correct
17 Correct 84 ms 12292 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 61 ms 5672 KB Output is correct
21 Correct 142 ms 22096 KB Output is correct
22 Correct 139 ms 22352 KB Output is correct
23 Correct 128 ms 22028 KB Output is correct
24 Correct 168 ms 22096 KB Output is correct
25 Correct 59 ms 12116 KB Output is correct
26 Correct 53 ms 12292 KB Output is correct
27 Correct 149 ms 22020 KB Output is correct
28 Correct 172 ms 22040 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
5 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Answer gives possible 0 while actual possible 1
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 8 ms 1108 KB Output is correct
7 Correct 131 ms 22036 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 344 KB Output is correct
12 Correct 13 ms 1116 KB Output is correct
13 Correct 178 ms 22100 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 860 KB Output is correct
17 Correct 84 ms 12292 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 61 ms 5672 KB Output is correct
21 Correct 142 ms 22096 KB Output is correct
22 Correct 139 ms 22352 KB Output is correct
23 Correct 128 ms 22028 KB Output is correct
24 Correct 168 ms 22096 KB Output is correct
25 Correct 59 ms 12116 KB Output is correct
26 Correct 53 ms 12292 KB Output is correct
27 Correct 149 ms 22020 KB Output is correct
28 Correct 172 ms 22040 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 8 ms 1108 KB Output is correct
7 Correct 131 ms 22036 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 344 KB Output is correct
12 Correct 13 ms 1116 KB Output is correct
13 Correct 178 ms 22100 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 860 KB Output is correct
17 Correct 84 ms 12292 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 61 ms 5672 KB Output is correct
21 Correct 142 ms 22096 KB Output is correct
22 Correct 139 ms 22352 KB Output is correct
23 Correct 128 ms 22028 KB Output is correct
24 Correct 168 ms 22096 KB Output is correct
25 Correct 59 ms 12116 KB Output is correct
26 Correct 53 ms 12292 KB Output is correct
27 Correct 149 ms 22020 KB Output is correct
28 Correct 172 ms 22040 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -