제출 #217079

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
217079	2020-03-28 22:48:27	Pajaraja	수도 (JOI20_capital_city)	C++17	100 / 100	729 ms	34296 KiB

capital_city

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 <bits/stdc++.h>
#define MAXN 200007
using namespace std;
int c[MAXN],ccnt[MAXN],p[MAXN],sz,ctr,rez=1000000000,br,n,k;
bool vi[MAXN],vc[MAXN],fas,vb[MAXN];
vector<int> g[MAXN],b[MAXN];
queue<int> q;
void dfssize(int s,int f)
{
  sz++; vi[s]=false; vb[c[s]]=false; ccnt[c[s]]=0;
  for(int i=0;i<g[s].size();i++) if(g[s][i]!=f && !vc[g[s][i]]) dfssize(g[s][i],s);
}
int fndctr(int s,int f)
{
  int sum=1;
  bool mb=true;
  for(int i=0;i<g[s].size();i++)  if(g[s][i]!=f && !vc[g[s][i]])
  {
    int x=fndctr(g[s][i],s);
    if(x>sz/2) mb=false;
    else sum+=x;
  }
  if(sz-sum>sz/2) mb=false;
  if(mb) ctr=s;
  return sum;
}
void dfsctr(int s,int f)
{
  ccnt[c[s]]++;
  p[s]=f;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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

capital_city.cpp: In function 'void dfssize(int, int)':
capital_city.cpp:11:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<g[s].size();i++) if(g[s][i]!=f && !vc[g[s][i]]) dfssize(g[s][i],s);
              ~^~~~~~~~~~~~
capital_city.cpp: In function 'int fndctr(int, int)':
capital_city.cpp:17:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<g[s].size();i++)  if(g[s][i]!=f && !vc[g[s][i]])
              ~^~~~~~~~~~~~
capital_city.cpp: In function 'void dfsctr(int, int)':
capital_city.cpp:31:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<g[s].size();i++) if(g[s][i]!=f && !vc[g[s][i]]) dfsctr(g[s][i],s);
              ~^~~~~~~~~~~~
capital_city.cpp: In function 'void dodajboju(int)':
capital_city.cpp:36:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(ccnt[co]!=b[co].size()) {fas=true; return;}
     ~~~~~~~~^~~~~~~~~~~~~~
capital_city.cpp:38:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<b[co].size();i++) q.push(b[co][i]);
              ~^~~~~~~~~~~~~
capital_city.cpp: In function 'void centrodecomp(int)':
capital_city.cpp:61:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<g[cent].size();i++) if(!vc[g[cent][i]]) centrodecomp(g[cent][i]);
              ~^~~~~~~~~~~~~~~
capital_city.cpp: In function 'int main()':
capital_city.cpp:65:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&k);
  ~~~~~^~~~~~~~~~~~~~
capital_city.cpp:69:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&t1,&t2);
   ~~~~~^~~~~~~~~~~~~~~~
capital_city.cpp:73:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=n;i++) scanf("%d",&c[i]);
                        ~~~~~^~~~~~~~~~~~

• Subtask 1: 1 / 1
• Subtask 2: 10 / 10
• Subtask 3: 30 / 30
• Subtask 4: 59 / 59