結果

問題 No.922 東北きりきざむたん
ユーザー butsurizukibutsurizuki
提出日時 2019-11-08 23:28:32
言語 C
(gcc 12.3.0)
結果
AC  
実行時間 185 ms / 2,000 ms
コード長 9,184 bytes
コンパイル時間 1,622 ms
コンパイル使用メモリ 36,592 KB
実行使用メモリ 59,696 KB
最終ジャッジ日時 2023-10-13 05:08:49
合計ジャッジ時間 4,929 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 10 ms
38,344 KB
testcase_01 AC 8 ms
34,884 KB
testcase_02 AC 8 ms
34,500 KB
testcase_03 AC 10 ms
37,416 KB
testcase_04 AC 11 ms
37,484 KB
testcase_05 AC 10 ms
37,644 KB
testcase_06 AC 10 ms
37,648 KB
testcase_07 AC 10 ms
36,956 KB
testcase_08 AC 9 ms
37,408 KB
testcase_09 AC 53 ms
45,300 KB
testcase_10 AC 39 ms
42,224 KB
testcase_11 AC 51 ms
43,032 KB
testcase_12 AC 19 ms
45,976 KB
testcase_13 AC 19 ms
42,016 KB
testcase_14 AC 73 ms
51,672 KB
testcase_15 AC 13 ms
48,456 KB
testcase_16 AC 144 ms
56,988 KB
testcase_17 AC 143 ms
55,908 KB
testcase_18 AC 145 ms
56,672 KB
testcase_19 AC 144 ms
57,160 KB
testcase_20 AC 147 ms
56,716 KB
testcase_21 AC 163 ms
56,676 KB
testcase_22 AC 161 ms
56,164 KB
testcase_23 AC 185 ms
57,004 KB
testcase_24 AC 184 ms
56,536 KB
testcase_25 AC 151 ms
56,344 KB
testcase_26 AC 151 ms
56,288 KB
testcase_27 AC 149 ms
56,736 KB
testcase_28 AC 39 ms
40,740 KB
testcase_29 AC 175 ms
59,696 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.c:16:5: 警告: conflicting types for built-in function ‘round’; expected ‘double(double)’ [-Wbuiltin-declaration-mismatch]
   16 | int round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
      |     ^~~~~
main.c:8:1: 備考: ‘round’ is declared in header ‘<math.h>’
    7 | #include<time.h>
  +++ |+#include <math.h>
    8 | #define inf 1072114514
main.c:17:5: 警告: conflicting types for built-in function ‘ceil’; expected ‘double(double)’ [-Wbuiltin-declaration-mismatch]
   17 | int ceil(int a,int b){if(a%b==0){return a/b;}return (a/b)+1;}
      |     ^~~~
main.c:17:5: 備考: ‘ceil’ is declared in header ‘<math.h>’
main.c:23:5: 警告: conflicting types for built-in function ‘pow’; expected ‘double(double,  double)’ [-Wbuiltin-declaration-mismatch]
   23 | int pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}
      |     ^~~
main.c:23:5: 備考: ‘pow’ is declared in header ‘<math.h>’
main.c:31:11: 警告: conflicting types for built-in function ‘llround’; expected ‘long long int(double)’ [-Wbuiltin-declaration-mismatch]
   31 | long long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
      |           ^~~~~~~
main.c:31:11: 備考: ‘llround’ is declared in header ‘<math.h>’

ソースコード

diff # 

//set many funcs template
//Ver.20190820
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<stdbool.h>
#include<time.h>
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384

int max(int a,int b){if(a>b){return a;}return b;}
int min(int a,int b){if(a<b){return a;}return b;}
int zt(int a,int b){return max(a,b)-min(a,b);}
int round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
int ceil(int a,int b){if(a%b==0){return a/b;}return (a/b)+1;}
int gcd(int a,int b){int c;while(b!=0){c=a%b;a=b;b=c;}return a;}
int lcm(int a,int b){int c=gcd(a,b);a/=c;return a*b;}
int nCr(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}
int nHr(int a,int b){return nCr(a+b-1,b);}
int fact(int a){int i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}
int pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}
int dsum(int x){int r=0;while(x){r+=(x%10);x/=10;}return r;}
int dsumb(int x,int b){int r=0;while(x){r+=(x%b);x/=b;}return r;}
int sankaku(int x){return ((1+x)*x)/2;}
void swap(int *a,int *b){int c;c=(*a);(*a)=(*b);(*b)=c;}
long long llmax(long long a,long long b){if(a>b){return a;}return b;}
long long llmin(long long a,long long b){if(a<b){return a;}return b;}
long long llzt(long long a,long long b){return llmax(a,b)-llmin(a,b);}
long long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
long long llceil(long long a,long long b){if(a%b==0){return a/b;}return (a/b)+1;}
long long llgcd(long long a,long long b){long long c;while(b!=0){c=a%b;a=b;b=c;}return a;}
long long lllcm(long long a,long long b){long long c=llgcd(a,b);a/=c;return a*b;}
long long llnCr(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}
long long llnHr(long long a,long long b){return llnCr(a+b-1,b);}
long long llfact(long long a){long long i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}
long long llpow(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}
long long lldsum(long long x){long long r=0;while(x){r+=(x%10);x/=10;}return r;}
long long lldsumb(long long x,long long b){long long r=0;while(x){r+=(x%b);x/=b;}return r;}
long long llsankaku(long long x){return ((1+x)*x)/2;}
void llswap(long long *a,long long *b){long long c;c=(*a);(*a)=(*b);(*b)=c;}
double dbmax(double a,double b){if(a>b){return a;}return b;}
double dbmin(double a,double b){if(a<b){return a;}return b;}
double dbzt(double a,double b){return dbmax(a,b)-dbmin(a,b);}
void dbswap(double *a,double *b){double c;c=(*a);(*a)=(*b);(*b)=c;}
void chswap(char *a,char *b){char c;c=(*a);(*a)=(*b);(*b)=c;}
int sortfncsj(const void *a,const void *b){if(*(int *)a>*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}
int sortfnckj(const void *a,const void *b){if(*(int *)a<*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}
int llsortfncsj(const void *a,const void *b){if(*(long long *)a>*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}
int llsortfnckj(const void *a,const void *b){if(*(long long *)a<*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}
int dbsortfncsj(const void *a,const void *b){if(*(double *)a>*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}
int dbsortfnckj(const void *a,const void *b){if(*(double *)a<*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}
int strsortfncsj(const void *a,const void *b){return strcmp((char *)a,(char *)b);}
int strsortfnckj(const void *a,const void *b){return strcmp((char *)b,(char *)a);}
int chsortfncsj(const void *a,const void *b){if(*(char *)a>*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;}
int chsortfnckj(const void *a,const void *b){if(*(char *)a<*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;}

void shuffledget(int x[],int n){
    int i,b[524288],p,c;
    for(i=0;i<n;i++){
        b[i]=i;
    }
    for(i=n;i>=1;i--){
        p=rand()%i;
        c=b[i-1];b[i-1]=b[p];b[p]=c;
    }
    for(i=0;i<n;i++){
        scanf("%d",&x[b[i]]);
    }
}

int dx4[4]={1,-1,0,0};
int dy4[4]={0,0,1,-1};
int dx8[8]={-1,-1,-1,0,0,1,1,1};
int dy8[8]={-1,0,1,-1,1,-1,0,1};

int search(int x,int a[],int n){
    int st=0,fi=n-1,te;
    while(st<=fi){
        te=(st+fi)/2;
        if(a[te]<x){st=te+1;}else{fi=te-1;}
    }
    return st;
}

void prarr(int arr[],int n){
  int i;
  for(i=0;i<n;i++){
    if(i){printf(" ");}
    printf("%d",arr[i]);
  }
  printf("\n");
  return;
}

void getperm(int a[],int n){
  int i,p;
  for(i=0;i<n;i++){
    a[i]=i;
  }
  for(i=n-1;i>=1;i--){
    p=rand()%(i+1);
    swap(&a[p],&a[i]);
  }
}

typedef struct{
long long val;
long long node;
}sd;

int sdsortfnc(const void *a,const void *b){
if(((sd*)a)->val < ((sd*)b)->val){return -1;}
if(((sd*)a)->val > ((sd*)b)->val){return 1;}
return 0;
}

//Queue Template
sd q[1048576];
long long qp=0,qqp=0;

void qpush(sd x){
    qp++;q[qp]=x;
}

sd qpop(){
    qqp++;
    return q[qqp];
}

typedef struct{
    long long st;
    long long fi;
    long long kr;
}rs;

typedef struct{
    long long st;
    long long kz;
}mkj;

int sortfnc(const void *a,const void *b){
if(((rs*)a)->st == ((rs*)b)->st){return 0;}
if(((rs*)a)->st < ((rs*)b)->st){return -1;}
return 1;
}

void makemkj(rs g[],mkj x[],long long n){
    long long i,ms=0,nst=g[0].st;
    for(i=1;i<n;i++){
        if(g[i].st!=g[i-1].st){
            x[nst].kz=i-ms;
            x[nst].st=ms;
            nst=g[i].st;ms=i;
        }
    }
    x[nst].kz=n-ms;
    x[nst].st=ms;
}

typedef struct{
    long long par;
    long long dep;
    long long size;
}node;

node uft[524288];

void resuf(){
    long long i;
    for(i=0;i<524288;i++){
        uft[i].par=i;uft[i].dep=0;uft[i].size=1;
    }
    return;
}

long long find(long long x){
    if(uft[x].par==x){return x;}
    else{uft[x].par=find(uft[x].par);return uft[x].par;}
}

void uni(long long x,long long y){
    long long xp,yp;
    xp=find(x);yp=find(y);
    if(xp==yp){return;}
    if(uft[xp].dep>uft[yp].dep){
        uft[yp].par=xp;
        uft[xp].size+=uft[yp].size;
    }
    else{
        uft[xp].par=yp;
        uft[yp].size+=uft[xp].size;
        if(uft[xp].dep==uft[yp].dep){uft[yp].dep++;}
    }
    return;
}

long long size(long long x){
    x=find(x);
    return uft[x].size;
}

rs g[524288];
mkj x[524288];
long long ds=0,w[524288]={0};

void bfs(long long v,long long p,long long l){
    ds+=l*w[v];
    long long i;
    for(i=x[v].st;i<x[v].st+x[v].kz;i++){
        if(g[i].fi==p){continue;}
        bfs(g[i].fi,v,l+1);
    }
}

int dist[524288],nrep[524288],doubling[524288][32];

void dfs(int t,int l,rs g[],mkj x[]){
  int i;
  if(dist[t]<=l){return;}
  dist[t]=l;
  for(i=0;i<30;i++){
    if((l-(1<<i))<0){break;}
    doubling[t][i]=nrep[(l-(1<<i))];
  }
  nrep[l]=t;
  for(i=x[t].st;i<x[t].st+x[t].kz;i++){
    dfs(g[i].fi,l+1,g,x);
  }
  nrep[l]=-1;
}

int query(int a,int b){
  int ah,bh,dh,i,st,fi,te;
  if(dist[a]<dist[b]){i=a;a=b;b=i;}
  ah=dist[a];
  bh=dist[b];
  dh=ah-bh;
  for(i=29;i>=0;i--){
    if((dh&(1<<i)) != 0){
      a=doubling[a][i];
    }
  }
  //printf("[[%d %d]]\n",a,b);
  while(a!=b){
    //printf("[%d %d]\n",a,b);
    st=0;fi=29;
    while(st<=fi){
      te=(st+fi)/2;
      if(doubling[a][te]==doubling[b][te]){fi=te-1;}
      else{st=te+1;}
    }
    if(fi==-1){
      return doubling[a][0];
    }
    a=doubling[a][fi];
    b=doubling[b][fi];
  }
  return a;
}

int main(void){
  resuf();
  long long i,j,n,m,k,a[524288],b[524288],c,h,r=0,l,t,qc,sw,mw,ns,bv;
  long long dp[524288]={0};
  long long fl[524288]={0};
  sd pd,od;
  scanf("%lld%lld%lld",&n,&m,&qc);
  for(i=0;i<=n;i++){dist[i]=inf;}
  for(i=0;i<m;i++){
      scanf("%lld%lld",&g[i].st,&g[i].fi);
      g[m+i].st=g[i].fi;
      g[m+i].fi=g[i].st;
      uni(g[i].st,g[i].fi);
  }
  qsort(g,2*m,sizeof(g[0]),sortfnc);
  makemkj(g,x,2*m);
  for(i=0;i<qc;i++){
      scanf("%lld%lld",&a[i],&b[i]);
      if(find(a[i])==find(b[i])){continue;}
      w[a[i]]++;w[b[i]]++;
  }
  for(i=1;i<=n;i++){
      if(fl[find(i)]==1){continue;}
      fl[find(i)]=1;
      dfs(i,0,g,x);
      qp=0;qqp=0;
      pd.node=i;
      pd.val=-1;
      sw=0;
      qpush(pd);
      while(qp!=qqp){
          od=qpop();
          sw+=w[od.node];
          dp[od.node]=w[od.node];
          for(j=x[od.node].st;j<x[od.node].st+x[od.node].kz;j++){
              if(g[j].fi==od.val){continue;}
              pd.node=g[j].fi;
              pd.val=od.node;
              qpush(pd);
          }
      }
      for(j=qp;j>=1;j--){
          ns=w[q[j].node];
          mw=0;
          for(k=x[q[j].node].st;k<x[q[j].node].st+x[q[j].node].kz;k++){
              if(g[k].fi==q[j].val){continue;}
              mw=llmax(mw,dp[g[k].fi]);
              ns+=dp[g[k].fi];
          }
          mw=llmax(sw-ns,mw);
          if(mw*2<=sw){bv=q[j].node;break;}
          else{dp[q[j].node]=ns;}
      }
      bfs(bv,-1,0);
  }
  for(i=0;i<qc;i++){
      if(find(a[i])!=find(b[i])){continue;}
      //printf("%lld %lld %lld\n",a[i],b[i],query(a[i],b[i]));
      ds+=dist[a[i]]+dist[b[i]]-2*dist[query(a[i],b[i])];
  }
  printf("%lld\n",ds);
  return 0;
}
0