oj.uz

Submission #653698

# Submission time Handle Problem Language Result Execution time Memory
653698 2022-10-27T17:40:48 Z Litusiano Connecting Supertrees (IOI20_supertrees) C++14
30 / 100
 219 ms 26060 KB 
#include "supertrees.h"
#include <vector>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <string>
#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define f first
#define s second
#define ii pair<int,int>
#define vi vector<int>
#define vvi vector<vi>
#define vvii vector<vector<ii>>
#define pb push_back
#define vpi vector<ii> 
#define forcin for(int i = 0; i<n; ++i) cin>>v[i];
#define pq priority_queue<ii>
#define mp make_pair
#define ld long double
#define vc vector<char>
#define vvc vector<vc>
#define vb vector<bool>
#define vvb vector<vb>
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define For(i, n, x) for (int i = x; i < n; i++)
#define rsz(a,x) assign(a,x)
#define endl "\n"
 
int construct(vvi p){
  // Cap cami, components diferents
  // tots == 1, graf lineal
  // tots == 2, graf lineal amb el ultim unit al primer
  int N = p.size();
  bool ok = 0;
  For(i,N,0){
    ok|=(p[i][i] == 0);
  }
  For(i,N,0){
    For(j,N,0){
      ok|=p[i][j] != p[j][i];
    }
  }
  if(ok) return 0;
  vvi used(N,vi(N,0));
  if(N == 1){
    if(p[0][0] == 1){
      build(used); return 1;
    }
    return 0;
  } 
  vpi edges;
  /*For(i,N,0){
    For(j,N,0) cout<<p[i][j]<<" "; cout<<endl;
  }*/
  for(auto x : p){
    for(auto e : x){
      if(e == 3) return 0;
    }
  }
  For(i,N,0){
    For(j,N,0){
      if(used[i][j] || i == j) continue;
      //cout<<p[i][j]<<" "<<j<<endl;
      if(p[i][j] == 0) continue;
      //cout<<i<<" "<<j<<endl;
      // si tinc 1, vaig buscant 1ns sino dosos
      int cur = j;
      set<int> act;
      edges.pb({i,j});
      act.insert(i);
      used[i][j] = used[j][i] = 1;
      // Miro TOT EL CICLE
      int last = j;
      int prev = i;
      while(!act.count(cur)){
        act.insert(j);
        bool b = false;
        int nextcur = i;
        For(k,N,0){
          //if(cur == j && k == i) continue;
          if(cur == k) continue;
          if(cur == 2){
            //cout<<"H"<<" "<<k<<" "<<act.count(k)<<" "<<used[cur][k]<<endl;
            //for(auto x : act) cout<<x<<" "; cout<<"ENDH"<<endl;
          }
          if(act.count(k) && cur != k){
            if(p[k][cur] != p[cur][k] || p[cur][k] != p[i][j]){
              //cout<<"HERE "<<cur<<" "<<k<<" "<<i<<" "<<j<<" "<<p[i][j]<<" "<<p[cur][k]<<endl;
              return 0;
            }
          }
          
          else if(!act.count(k) && p[cur][k] == p[i][j] && !used[cur][k] && !b){
            //cout<<i<<" "<<j<<" CUR "<<cur<<" "<<k<<endl;
            //for(auto x : act) cout<<x<<" "; cout<<endl;
            //act.insert(k);
            for(auto x : act){
              used[x][k] = used[k][x] = 1;
            }
            b = 1;
            //afegir edge
            edges.pb({cur,k});
            used[cur][k] = 1;
            used[k][cur] = 1;
            last = cur;
            nextcur = k;
          }
        }
        act.insert(cur);
        last = cur;
        cur = nextcur;
      }
      //cout<<i<<" "<<j<<endl;
      //for(auto x : act) cout<<x<<" "; cout<<endl;
      //cerr<<last<<" "<<i<<endl;
      if(p[i][j] == 2) edges.pb({last,i});
      if(act.size() <= 2 && p[i][j] == 2){
        //cerr<<i<<" "<<j<<" "<<endl;
        //for(auto x : act) cerr<<x<<" "; cerr<<endl;
        return 0;
      }
    }
  }
  //cout<<"AAAAA"<<endl;
  //cerr<<edges.size()<<endl;
  
  vvi ans(N,vi(N,0));
  if(!edges.size()){
    // 1 0 1 0 1 0 1 0 1 
    For(i,N,0){
      For(j,N,0){
        if(p[i][j] == 1 && i != j) return 0;
        if(p[i][j] == 2) return 0;
      }
    }
    build(ans); return 1;
  }
  sort(all(edges));
  for(auto x : edges){
    //if(ans[x.f][x.s]) return 0;
    ans[x.f][x.s] = ans[x.s][x.f] = 1;
    //cerr<<x.f<<" "<<x.s<<endl;
  }
  build(ans);
  return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:78:11: warning: unused variable 'prev' [-Wunused-variable]
   78 |       int prev = i;
      |           ^~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 9 ms 1336 KB Output is correct
7 Correct 209 ms 26004 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 9 ms 1336 KB Output is correct
7 Correct 209 ms 26004 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 9 ms 1336 KB Output is correct
13 Correct 178 ms 25988 KB Output is correct
14 Incorrect 1 ms 212 KB Answer gives possible 1 while actual possible 0
15 Halted 0 ms 0 KB -

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 8 ms 1352 KB Output is correct
9 Correct 202 ms 25988 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 8 ms 1364 KB Output is correct
13 Correct 211 ms 25904 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 4 ms 724 KB Output is correct
17 Correct 84 ms 12036 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 47 ms 6792 KB Output is correct
22 Correct 189 ms 26024 KB Output is correct
23 Correct 171 ms 25932 KB Output is correct
24 Correct 219 ms 25996 KB Output is correct
25 Correct 68 ms 12108 KB Output is correct
26 Correct 77 ms 12040 KB Output is correct
27 Correct 186 ms 25920 KB Output is correct
28 Correct 219 ms 25932 KB Output is correct
29 Correct 68 ms 12164 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 45 ms 6664 KB Output is correct
5 Correct 204 ms 25996 KB Output is correct
6 Correct 173 ms 25932 KB Output is correct
7 Correct 213 ms 25984 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 46 ms 6732 KB Output is correct
10 Correct 183 ms 26060 KB Output is correct
11 Correct 176 ms 25944 KB Output is correct
12 Correct 214 ms 25988 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Incorrect 0 ms 212 KB Answer gives possible 0 while actual possible 1
16 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 9 ms 1336 KB Output is correct
7 Correct 209 ms 26004 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 9 ms 1336 KB Output is correct
13 Correct 178 ms 25988 KB Output is correct
14 Incorrect 1 ms 212 KB Answer gives possible 1 while actual possible 0
15 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 9 ms 1336 KB Output is correct
7 Correct 209 ms 26004 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 9 ms 1336 KB Output is correct
13 Correct 178 ms 25988 KB Output is correct
14 Incorrect 1 ms 212 KB Answer gives possible 1 while actual possible 0
15 Halted 0 ms 0 KB -