oj.uz

Submission #490206

# Submission time Handle Problem Language Result Execution time Memory
490206 2021-11-26T09:50:19 Z cpp219 Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
 240 ms 24012 KB 
#include<bits/stdc++.h>
#include "supertrees.h"
#define ll int
#define ld long double
#define fs first
#define sc second
#define debug(y) cout<<y,exit(0)
using namespace std;
typedef pair<ll,ll> LL;
const ll N = 1e3 + 9;
const ll mod = 1e9 + 7;
const ll base = 31;

vector<vector<ll>> ans;
vector<LL> g1,g2;
ll n,ok[N];

int construct(vector<vector<int>> p){
    n = p.size(); ans = p;
    for (ll i = 0;i < n;i++){
        for (ll j = 0;j < n;j++) ans[i][j] = 0;
    }
    for (ll i = 0;i < n;i++)
        for (ll j = 0;j < n;j++) if (p[i][j] == 3) return 0;

    for (ll i = 0;i < n;i++){
        ll now = 0;
        while(p[i][now] != 1) now++;
        if (now != i){
            if (p[i] != p[now]) return 0;
            ans[now][i] = ans[i][now] = 1;
        }
        else ok[i] = 1;
    }

    for(ll i = 0;i < n;i++) if(ok[i]){
		ll cc = 0;
		while(!p[i][cc]) cc++;
		for(ll j = 0;j < n;j++)
			if((p[cc][j] == 0) ^ (p[i][j] == 0)) return 0;
		if(cc == i){
			ll now = i;
			for(ll j = i + 1;j < n;j++)
				if(ok[j] && p[i][j]){
					ans[now][j] = 1; ans[j][now] = 1;
					now = j;
				}

			else if(now != i && ans[now][i]) return 0;
			else if (now != i){
				ans[now][i] = ans[i][now] = 1;
			}
		}
	}
    build(ans);
    return 1;
}
/*
int main(){
    ios_base::sync_with_stdio(NULL); cin.tie(0); cout.tie(0);
    #define task "test"
    if (fopen(task".inp","r")){
        freopen(task".inp","r",stdin);
        //freopen(task".out","w",stdout);
    }
    ll sz; vector<vector<ll>> p;
    cin>>sz;
    for (ll i = 0;i < sz;i++){
        vector<ll> tmp; ll x;
        for (ll j = 0;j < sz;j++) cin>>x,tmp.push_back(x);
        p.push_back(tmp);
    }
    cout<<construct(p)<<"\n";
}
*/
/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* WRITE STUFF DOWN
	* DON'T GET STUCK ON ONE APPROACH
*/

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 7 ms 1172 KB Output is correct
7 Correct 163 ms 23968 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 7 ms 1172 KB Output is correct
7 Correct 163 ms 23968 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 9 ms 1228 KB Output is correct
13 Correct 178 ms 23920 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 3 ms 844 KB Output is correct
17 Correct 75 ms 14028 KB Output is correct
18 Correct 0 ms 240 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 43 ms 6384 KB Output is correct
21 Correct 169 ms 24012 KB Output is correct
22 Correct 176 ms 23976 KB Output is correct
23 Correct 179 ms 23880 KB Output is correct
24 Correct 240 ms 23928 KB Output is correct
25 Correct 73 ms 14084 KB Output is correct
26 Correct 69 ms 14076 KB Output is correct
27 Correct 169 ms 23888 KB Output is correct
28 Correct 227 ms 24008 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Incorrect 0 ms 204 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 1 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Too few ways to get from 0 to 1, should be 2 found 1
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 7 ms 1172 KB Output is correct
7 Correct 163 ms 23968 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 9 ms 1228 KB Output is correct
13 Correct 178 ms 23920 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 3 ms 844 KB Output is correct
17 Correct 75 ms 14028 KB Output is correct
18 Correct 0 ms 240 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 43 ms 6384 KB Output is correct
21 Correct 169 ms 24012 KB Output is correct
22 Correct 176 ms 23976 KB Output is correct
23 Correct 179 ms 23880 KB Output is correct
24 Correct 240 ms 23928 KB Output is correct
25 Correct 73 ms 14084 KB Output is correct
26 Correct 69 ms 14076 KB Output is correct
27 Correct 169 ms 23888 KB Output is correct
28 Correct 227 ms 24008 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Incorrect 0 ms 204 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 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 7 ms 1172 KB Output is correct
7 Correct 163 ms 23968 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 9 ms 1228 KB Output is correct
13 Correct 178 ms 23920 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 3 ms 844 KB Output is correct
17 Correct 75 ms 14028 KB Output is correct
18 Correct 0 ms 240 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 43 ms 6384 KB Output is correct
21 Correct 169 ms 24012 KB Output is correct
22 Correct 176 ms 23976 KB Output is correct
23 Correct 179 ms 23880 KB Output is correct
24 Correct 240 ms 23928 KB Output is correct
25 Correct 73 ms 14084 KB Output is correct
26 Correct 69 ms 14076 KB Output is correct
27 Correct 169 ms 23888 KB Output is correct
28 Correct 227 ms 24008 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Incorrect 0 ms 204 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -