結果
| 問題 |
No.922 東北きりきざむたん
|
| コンテスト | |
| ユーザー |
 butsurizuki
|
| 提出日時 | 2019-11-08 23:14:00 |
| 言語 | C (gcc 13.3.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 8,195 bytes |
| コンパイル時間 | 923 ms |
| コンパイル使用メモリ | 36,096 KB |
| 実行使用メモリ | 41,508 KB |
| 最終ジャッジ日時 | 2024-09-15 02:22:07 |
| 合計ジャッジ時間 | 4,323 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 WA * 1 |
| other | AC * 4 WA * 22 |
コンパイルメッセージ
main.c:16:5: warning: 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: note: 'round' is declared in header '<math.h>'
7 | #include<time.h>
+++ |+#include <math.h>
8 | #define inf 1072114514
main.c:17:5: warning: 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: note: 'ceil' is declared in header '<math.h>'
main.c:23:5: warning: 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: note: 'pow' is declared in header '<math.h>'
main.c:31:11: warning: 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: note: 'llround' is declared in header '<math.h>'
ソースコード
//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 main(void){
resuf();
long long i,j,n,m,k,a,b,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<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,&b);
//printf("%lld %lld\n",find(a),find(b));
//if(find(a)==find(b)){continue;}
w[a]=1;w[b]=1;
}
for(i=1;i<=n;i++){
if(fl[find(i)]==1){continue;}
fl[find(i)]=1;
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;}
//fprintf(stderr,"%lld <- %lld\n",);
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;}
//fprintf(stderr,"%lld %lld\n",q[j].node,ns);
}
bfs(bv,-1,0);
}
printf("%lld\n",ds);
return 0;
}