제출 #300693

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
300693	2020-09-17 12:06:36	haojiandan	슈퍼트리 잇기 (IOI20_supertrees)	C++14	40 / 100	250 ms	22264 KiB

supertrees

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn=1010;
queue<int> q,q2;
bool vis[maxn];
int fa[maxn],line[maxn];
int construct(vector<vector<int> > p) {
  int n = p.size();
  vector<vector<int> > ans;
  for (int i = 0; i < n; i++) {
    vector<int> row;
    row.resize(n);
    ans.push_back(row);
  }
  for (int i=0;i<n;i++) for (int j=0;j<n;j++) if (p[i][j]==3) return 0;
  int lst;
  for (int i=0;i<n;i++) if (!vis[i]) {
    q.push(i); vis[i]=1;
    vector<int> circle; circle.clear();
    while (!q.empty()) {
      int u=q.front(); q.pop();
      circle.push_back(u);
      
      q2.push(u); lst=-1;
      while (!q2.empty()) {
        int v=q2.front(); q2.pop();
        vis[v]=1;
        //printf("%d %d %d\n",i,u,v);
        fa[v]=i,line[v]=u;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

컴파일 시 표준 에러 (stderr) 메시지

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

• Subtask 1: 11 / 11
• Subtask 2: 10 / 10
• Subtask 3: 19 / 19
• Subtask 4: 0 / 35
• Subtask 5: 0 / 21
• Subtask 6: 0 / 4