Submission #2379492


Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
typedef long long LL;
const int N=1e6;
int n,m,vis[N+10],head[N+10],tot;
LL cnt1=0,cnt2=0,cnt3=0;
struct data {
    int next,num;
}edge[N+10];
void Add(int u,int v) {
    edge[++tot].next=head[u];
    edge[tot].num=v;
    head[u]=tot;
}
int dfs(int x,int k) {
    if (vis[x]!=-1&&vis[x]!=k) return 0;
    if (vis[x]!=-1) return 1;
    vis[x]=k;
    int ans=1;
    for (int i=head[x];i!=-1;i=edge[i].next) {
	int kx=edge[i].num;
	int nowk=dfs(kx,k^1);
	if (nowk==0) ans=0;
    }
    return ans;
}
int main() {
    memset(head,-1,sizeof(head));
    scanf("%d%d",&n,&m);
    for (int i=1;i<=m;i++) {
	int u,v;
	scanf("%d%d",&u,&v);
	Add(u,v);
	Add(v,u);
    }
    memset(vis,-1,sizeof(vis));
    for (int i=1;i<=n;i++) {
	if (vis[i]!=-1) continue;
	if (head[i]==-1) {
	    cnt3++;
	    continue;
	}
	int k=dfs(i,1);
	if (k==0) cnt1++;
	else cnt2++;
    }
    LL ans=(LL)n*n-(n-cnt3)*(n-cnt3);
    ans+=cnt1*cnt1+cnt1*cnt2*2+cnt2*cnt2*2;
    printf("%lld\n",ans);
    return 0;
}

Submission Info

Submission Time
Task C - Squared Graph
User codefestival
Language C++14 (GCC 5.4.1)
Score 800
Code Size 1125 Byte
Status AC
Exec Time 49 ms
Memory 16640 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:32:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&m);
                        ^
./Main.cpp:35:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&u,&v);
                     ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 800 / 800
Status
AC × 2
AC × 32
Set Name Test Cases
Sample sample1.txt, sample2.txt
All sample1.txt, sample2.txt, in1.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in2.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in3.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt
Case Name Status Exec Time Memory
in1.txt AC 4 ms 9728 KB
in10.txt AC 4 ms 9728 KB
in11.txt AC 4 ms 9728 KB
in12.txt AC 14 ms 10496 KB
in13.txt AC 13 ms 10496 KB
in14.txt AC 24 ms 11264 KB
in15.txt AC 5 ms 9856 KB
in16.txt AC 19 ms 10880 KB
in17.txt AC 15 ms 10880 KB
in18.txt AC 35 ms 14848 KB
in19.txt AC 26 ms 12544 KB
in2.txt AC 4 ms 9728 KB
in20.txt AC 27 ms 12544 KB
in21.txt AC 49 ms 16640 KB
in22.txt AC 42 ms 14208 KB
in23.txt AC 39 ms 13824 KB
in24.txt AC 4 ms 9728 KB
in25.txt AC 49 ms 16640 KB
in26.txt AC 4 ms 9728 KB
in27.txt AC 4 ms 9728 KB
in28.txt AC 48 ms 16640 KB
in3.txt AC 4 ms 9728 KB
in4.txt AC 4 ms 9728 KB
in5.txt AC 38 ms 13824 KB
in6.txt AC 5 ms 9856 KB
in7.txt AC 5 ms 9856 KB
in8.txt AC 7 ms 9984 KB
in9.txt AC 17 ms 11264 KB
sample1.txt AC 4 ms 9728 KB
sample2.txt AC 4 ms 9728 KB