Submission #956899


Source Code Expand

#include <iostream>
#include <algorithm>
#include <map>
#include <string>
#include <set>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <bitset>
#include <random>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <complex>
#include <functional>
using namespace std;
#define rep(i,a,b) for(int i = (a); i < int(b); ++i)
#define rrep(i,a,b) for(int i = (b); i --> int(a);)
#define all(v) v.begin(),v.end()
#define trav(x, v) for(auto &x : v)
#define sz(v) int((v).size())
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long double ld;

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	int n, m;
	cin >> n >> m;
	vi in(n), out(n);
	vector<vi> gr(n);
	vector<vi> type(n);
	rep(_,0,m){
		int a,b;
		cin >> a >> b;
		--a, --b;
		++in[a], ++out[b];
		gr[a].push_back(b), gr[b].push_back(a);
		type[a].push_back(1);
		type[b].push_back(2);
	}
	ll ans = 0;
	vector<bool> vis(n);
	vector<int> col(n);
	rep(i,0,n) if(!vis[i]){
		bool paint = 0, paintall = 0;
		int stor = 0;
		int es = 0;
		ll cnt[3] = {};
		function<void(int)> f = [&](int v){
			++cnt[col[v]];
			vis[v] = 1;
			es += in[v];
			++stor;
			paint |= in[v] && out[v];
			rep(i,0,sz(gr[v])){
				int u = gr[v][i];
				int ucol = (col[v]+type[v][i])%3;
				if(!vis[u]){
					col[u] = ucol;
					f(u);
				} else if(col[u] != ucol){
					paintall = 1;
				}
			}
		};
		f(i);
		if(paintall)
			ans += (ll)stor*(stor-1) + stor;
		else if(paint)
			ans += cnt[0]*cnt[1] + cnt[1]*cnt[2] + cnt[2]*cnt[0];
		else
			ans += es;
	}
	cout << ans << endl;
}

Submission Info

Submission Time
Task F - Blackout
User aitch
Language C++14 (GCC 5.4.1)
Score 1700
Code Size 1669 Byte
Status AC
Exec Time 76 ms
Memory 18688 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1700 / 1700
Status
AC × 3
AC × 53
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 3 ms 256 KB
0_01.txt AC 2 ms 256 KB
0_02.txt AC 3 ms 256 KB
1_00.txt AC 3 ms 256 KB
1_01.txt AC 14 ms 6144 KB
1_02.txt AC 54 ms 12416 KB
1_03.txt AC 57 ms 18688 KB
1_04.txt AC 57 ms 18688 KB
1_05.txt AC 59 ms 18688 KB
1_06.txt AC 57 ms 18688 KB
1_07.txt AC 57 ms 18688 KB
1_08.txt AC 57 ms 18688 KB
1_09.txt AC 57 ms 18688 KB
1_10.txt AC 59 ms 18688 KB
1_11.txt AC 59 ms 18688 KB
1_12.txt AC 57 ms 18688 KB
1_13.txt AC 59 ms 18688 KB
1_14.txt AC 41 ms 13168 KB
1_15.txt AC 43 ms 13168 KB
1_16.txt AC 42 ms 13168 KB
1_17.txt AC 22 ms 2816 KB
1_18.txt AC 69 ms 13312 KB
1_19.txt AC 70 ms 13312 KB
1_20.txt AC 68 ms 13184 KB
1_21.txt AC 68 ms 13312 KB
1_22.txt AC 70 ms 13312 KB
1_23.txt AC 70 ms 13312 KB
1_24.txt AC 67 ms 13184 KB
1_25.txt AC 73 ms 13312 KB
1_26.txt AC 68 ms 13056 KB
1_27.txt AC 67 ms 13184 KB
1_28.txt AC 67 ms 13184 KB
1_29.txt AC 68 ms 13312 KB
1_30.txt AC 67 ms 13056 KB
1_31.txt AC 67 ms 13056 KB
1_32.txt AC 68 ms 13312 KB
1_33.txt AC 68 ms 13312 KB
1_34.txt AC 63 ms 11264 KB
1_35.txt AC 56 ms 8320 KB
1_36.txt AC 75 ms 10112 KB
1_37.txt AC 70 ms 12416 KB
1_38.txt AC 54 ms 7168 KB
1_39.txt AC 51 ms 6528 KB
1_40.txt AC 76 ms 12800 KB
1_41.txt AC 71 ms 12800 KB
1_42.txt AC 58 ms 9216 KB
1_43.txt AC 56 ms 8576 KB
1_44.txt AC 65 ms 11392 KB
1_45.txt AC 48 ms 5760 KB
1_46.txt AC 65 ms 11904 KB
1_47.txt AC 68 ms 12672 KB
1_48.txt AC 55 ms 7936 KB
1_49.txt AC 60 ms 9856 KB