oj.uz

답안 #437663

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
437663 2021-06-26T18:58:47 Z xiaowuc1 슈퍼트리 잇기 (IOI20_supertrees) C++17
21 / 100
 261 ms 24184 KB 
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>
#include "supertrees.h"

using namespace std;

// BEGIN NO SAD
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
typedef vector<int> vi;
#define f first
#define s second
// END NO SAD
 
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vector<ll>> matrix;
 
int find(vector<int>& p, int x) {
  return p[x] == x ? x : (p[x] = find(p, p[x]));
}
void merge(vector<int>& p, int x, int y) {
  p[find(p, x)] = find(p, y);
}
 
int construct(vector<vector<int>> p) {
  int n = sz(p);
  vector<vector<int>> ret;
  for(int i = 0; i < n; i++) {
    vector<int> t(n);
    ret.pb(t);
  }
  for(int i = 0; i < n; i++) for(int j = 0; j < n; j++) if(p[i][j] == 3) return 0;
  vector<int> connectedcomponent(n);
  iota(all(connectedcomponent), 0);
  for(int i = 0; i < n; i++) for(int j = 0; j < n; j++) if(p[i][j]) merge(connectedcomponent, i, j);
  // check zero
  for(int i = 0; i < n; i++) for(int j = 0; j < n; j++) if(p[i][j] == 0 && find(connectedcomponent, i) == find(connectedcomponent, j)) return 0;
  // check one
  vector<int> oneedge(n);
  iota(all(oneedge), 0);
  for(int i = 0; i < n; i++) for(int j = 0; j < n; j++) if(p[i][j] == 1) merge(oneedge, i, j);
  for(int i = 0; i < n; i++) for(int j = 0; j < n; j++) {
		if(p[i][j] == 0) continue;
		if(p[i][j] != 1 && find(oneedge, i) != find(oneedge, j)) return 0; 
	}
  map<int, int> treetoroot;
  for(int i = 0; i < n; i++) {
    if(!treetoroot.count(find(oneedge, i))) {
      treetoroot[find(oneedge, i)] = i;
    }
    else {
      ret[treetoroot[find(oneedge, i)]][i] = 1;
      ret[i][treetoroot[find(oneedge, i)]] = 1;
    }
  }
  map<int, set<int>> roots;
  for(int i = 0; i < n; i++) {
    roots[find(connectedcomponent, i)].insert(treetoroot[find(oneedge, i)]);
  }
  for(auto out: roots) {
		cerr << out.f << " has roots:";
		for(auto out2: out.s) cerr << " " << out2; cerr << endl;
    if(sz(out.s) == 2) return 0;
    if(sz(out.s) == 1) continue;
    vector<int> v(all(out.s));
    for(int i = 0; i < sz(v); i++) {
      int j = (i+1)%sz(v);
      ret[v[i]][v[j]] = 1;
      ret[v[j]][v[i]] = 1;
    }
  }
  build(ret);
  return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:83:3: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   83 |   for(auto out2: out.s) cerr << " " << out2; cerr << endl;
      |   ^~~
supertrees.cpp:83:46: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   83 |   for(auto out2: out.s) cerr << " " << out2; cerr << endl;
      |                                              ^~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 268 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 11 ms 1100 KB Output is correct
7 Correct 251 ms 22008 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 268 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 11 ms 1100 KB Output is correct
7 Correct 251 ms 22008 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 12 ms 1196 KB Output is correct
13 Correct 245 ms 24184 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 6 ms 760 KB Output is correct
17 Correct 116 ms 14072 KB Output is correct
18 Correct 1 ms 296 KB Output is correct
19 Correct 1 ms 288 KB Output is correct
20 Correct 62 ms 6212 KB Output is correct
21 Correct 244 ms 23916 KB Output is correct
22 Correct 239 ms 24004 KB Output is correct
23 Correct 261 ms 24004 KB Output is correct
24 Correct 261 ms 24132 KB Output is correct
25 Correct 113 ms 13992 KB Output is correct
26 Correct 101 ms 14064 KB Output is correct
27 Correct 260 ms 23924 KB Output is correct
28 Correct 243 ms 24132 KB Output is correct

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Incorrect 1 ms 204 KB Answer gives possible 0 while actual possible 1
6 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB Answer gives possible 0 while actual possible 1
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 268 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 11 ms 1100 KB Output is correct
7 Correct 251 ms 22008 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 12 ms 1196 KB Output is correct
13 Correct 245 ms 24184 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 6 ms 760 KB Output is correct
17 Correct 116 ms 14072 KB Output is correct
18 Correct 1 ms 296 KB Output is correct
19 Correct 1 ms 288 KB Output is correct
20 Correct 62 ms 6212 KB Output is correct
21 Correct 244 ms 23916 KB Output is correct
22 Correct 239 ms 24004 KB Output is correct
23 Correct 261 ms 24004 KB Output is correct
24 Correct 261 ms 24132 KB Output is correct
25 Correct 113 ms 13992 KB Output is correct
26 Correct 101 ms 14064 KB Output is correct
27 Correct 260 ms 23924 KB Output is correct
28 Correct 243 ms 24132 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Incorrect 1 ms 204 KB Answer gives possible 0 while actual possible 1
34 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 268 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 11 ms 1100 KB Output is correct
7 Correct 251 ms 22008 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 12 ms 1196 KB Output is correct
13 Correct 245 ms 24184 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 6 ms 760 KB Output is correct
17 Correct 116 ms 14072 KB Output is correct
18 Correct 1 ms 296 KB Output is correct
19 Correct 1 ms 288 KB Output is correct
20 Correct 62 ms 6212 KB Output is correct
21 Correct 244 ms 23916 KB Output is correct
22 Correct 239 ms 24004 KB Output is correct
23 Correct 261 ms 24004 KB Output is correct
24 Correct 261 ms 24132 KB Output is correct
25 Correct 113 ms 13992 KB Output is correct
26 Correct 101 ms 14064 KB Output is correct
27 Correct 260 ms 23924 KB Output is correct
28 Correct 243 ms 24132 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Incorrect 1 ms 204 KB Answer gives possible 0 while actual possible 1
34 Halted 0 ms 0 KB -