Submission #966046
Source Code Expand
#pragma comment(linker, "/STACK:102400000,102400000")
#include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define pii pair<int,int>
#define pb push_back
#define mp make_pair
#define all(x) x.begin(),x.end()
#define SZ(x) (int)(x.size())
#define rep(i,a,b) for(int i=a;i<b;i++)
#define per(i,a,b) for(int i=b-1;i>=a;i--)
#define inf 1000000007
#define mod 1000000007
#define x first
#define y second
#define pi acos(-1.0)
#define DBG(x) cerr<<(#x)<<"="<<x<<"\n";
//#define dprintf(...)
#define hash _hash
#define next _next
//#define dprintf(...) fprintf(outFile,__VA_ARGS__)
#define FOREACH(it,x) for(__typeof(x.begin()) it=x.begin();it!=x.end();it++)
#define ull unsigned long long
#define ll long long
#define N 100005
template <class T,class U>inline void Max(T &a,U b){if(a<b)a=b;}
template <class T,class U>inline void Min(T &a,U b){if(a>b)a=b;}
//FILE* outFile;
inline void add(int &a,int b){a+=b;while(a>=mod)a-=mod;}
int pow(int a,int b){
int ans=1;
while(b){
if(b&1)ans=ans*(ll)a%mod;
a=(ll)a*a%mod;b>>=1;
}
return ans;
}
vector<pii>g[N];
ll c[3];
int f,e,vis[N];
void dfs(int u,int d){
c[d]++;vis[u]=d+1;
FOREACH(it,g[u]){
int j=it->x,k=it->y;e++;
if(vis[j]){
f&=((d+k)%3==vis[j]-1);
}
else dfs(j,(d+k)%3);
}
}
int main(){
//freopen("1.txt","w",stdout);
//cout<<setprecision(3)<<fixed;
int T,i,j,k,n,m=0,K=0;
scanf("%d%d",&n,&m);
while(m--){
scanf("%d%d",&i,&j),i--,j--;
g[i].pb({j,1});
g[j].pb({i,2});
}
ll ans=0;
rep(i,0,n)if(!vis[i]){
e=0;f=1;c[0]=c[1]=c[2]=0;
dfs(i,0);
if(f){
if(c[1]&&c[2])ans+=c[0]*c[1]+c[1]*c[2]+c[2]*c[0];
else ans+=e/2;
}
else ans+=(c[0]+c[1]+c[2])*(c[0]+c[1]+c[2]);
}
printf("%lld\n",ans);
return 0;
}
Submission Info
Submission Time
2016-11-04 21:20:27+0900
Task
F - Blackout
User
cn16sp1357u
Language
C++14 (GCC 5.4.1)
Score
1700
Code Size
1963 Byte
Status
AC
Exec Time
48 ms
Memory
10752 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:61: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:63:36: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&i,&j),i--,j--;
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
1700 / 1700
Status
Set Name
Test Cases
Sample
0_00.txt, 0_01.txt, 0_02.txt
All
0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt, 1_44.txt, 1_45.txt, 1_46.txt, 1_47.txt, 1_48.txt, 1_49.txt
Case Name
Status
Exec Time
Memory
0_00.txt
AC
5 ms
2560 KB
0_01.txt
AC
5 ms
2560 KB
0_02.txt
AC
5 ms
2560 KB
1_00.txt
AC
5 ms
2560 KB
1_01.txt
AC
6 ms
2944 KB
1_02.txt
AC
35 ms
6144 KB
1_03.txt
AC
41 ms
10752 KB
1_04.txt
AC
41 ms
10752 KB
1_05.txt
AC
40 ms
10752 KB
1_06.txt
AC
41 ms
10752 KB
1_07.txt
AC
40 ms
10752 KB
1_08.txt
AC
40 ms
10752 KB
1_09.txt
AC
41 ms
10752 KB
1_10.txt
AC
41 ms
10752 KB
1_11.txt
AC
40 ms
10752 KB
1_12.txt
AC
41 ms
10752 KB
1_13.txt
AC
41 ms
10752 KB
1_14.txt
AC
31 ms
6900 KB
1_15.txt
AC
31 ms
6900 KB
1_16.txt
AC
31 ms
6900 KB
1_17.txt
AC
25 ms
5248 KB
1_18.txt
AC
48 ms
7680 KB
1_19.txt
AC
46 ms
7680 KB
1_20.txt
AC
46 ms
7680 KB
1_21.txt
AC
47 ms
7680 KB
1_22.txt
AC
46 ms
7680 KB
1_23.txt
AC
46 ms
7680 KB
1_24.txt
AC
46 ms
7552 KB
1_25.txt
AC
47 ms
7808 KB
1_26.txt
AC
47 ms
7680 KB
1_27.txt
AC
45 ms
7552 KB
1_28.txt
AC
46 ms
7680 KB
1_29.txt
AC
47 ms
7680 KB
1_30.txt
AC
47 ms
7552 KB
1_31.txt
AC
46 ms
7680 KB
1_32.txt
AC
46 ms
7680 KB
1_33.txt
AC
47 ms
7680 KB
1_34.txt
AC
45 ms
7680 KB
1_35.txt
AC
43 ms
7040 KB
1_36.txt
AC
44 ms
7424 KB
1_37.txt
AC
46 ms
7680 KB
1_38.txt
AC
41 ms
6656 KB
1_39.txt
AC
40 ms
6528 KB
1_40.txt
AC
47 ms
7680 KB
1_41.txt
AC
47 ms
7680 KB
1_42.txt
AC
42 ms
7168 KB
1_43.txt
AC
43 ms
7168 KB
1_44.txt
AC
45 ms
7680 KB
1_45.txt
AC
38 ms
6272 KB
1_46.txt
AC
46 ms
7680 KB
1_47.txt
AC
46 ms
7680 KB
1_48.txt
AC
42 ms
6912 KB
1_49.txt
AC
44 ms
7424 KB