Task: | Freshman's Database |
Sender: | hugues |
Submission time: | 2016-09-24 15:25:59 +0300 |
Language: | C++ |
Status: | READY |
Result: | TIME LIMIT EXCEEDED |
test | verdict | time | |
---|---|---|---|
#1 | ACCEPTED | 0.05 s | details |
#2 | ACCEPTED | 0.06 s | details |
#3 | ACCEPTED | 0.32 s | details |
#4 | ACCEPTED | 0.52 s | details |
#5 | TIME LIMIT EXCEEDED | -- | details |
#6 | TIME LIMIT EXCEEDED | -- | details |
#7 | TIME LIMIT EXCEEDED | -- | details |
#8 | ACCEPTED | 0.89 s | details |
#9 | ACCEPTED | 0.52 s | details |
#10 | TIME LIMIT EXCEEDED | -- | details |
Code
using namespace std; #include <bits/stdc++.h> #define sz(x) ((int)x.size()) #define sqr(x) ((x)*(x)) #define pb push_back #define clr clear() #define inf (1<<30) #define eps 1e-9 typedef long long i64; typedef unsigned long long ui64; #include <math.h> vector<bool> visited; vector<bool> is_cycle; vector<int> adj; int cycles = 0; int start = 0; void dfs(int node){ if(is_cycle[node]){ return; } if(visited[node]){ if(node == start){ cycles++; is_cycle[node] = true; is_cycle[start] = true; } return; } visited[node] = true; dfs(adj[node]); visited[node] = false; } int main() { ios_base::sync_with_stdio(0); int n; cin >> n; for(int i = 0 ; i < n; i++){ int temp; cin >> temp; adj.pb(temp - 1); visited.pb(false); is_cycle.pb(false); } for(int i = 0; i < n ; i++){ if(!is_cycle[i]){ start = i; dfs(i); } } cout << cycles << endl; return 0; }
Test details
Test 1
Verdict: ACCEPTED
input |
---|
16
2 3 4 5 6 1 4 7 7 4 12 11 14 1... |
correct output |
---|
3 |
user output |
---|
3 |
Test 2
Verdict: ACCEPTED
input |
---|
2
2 1 |
correct output |
---|
1 |
user output |
---|
1 |
Test 3
Verdict: ACCEPTED
input |
---|
1000000 906853 1 1 1 3 4 3 2 5 5 5 10 ... |
correct output |
---|
1 |
user output |
---|
1 |
Test 4
Verdict: ACCEPTED
input |
---|
1000000 227998 891986 290950 887622 37... |
correct output |
---|
6736 |
user output |
---|
6736 |
Test 5
Verdict: TIME LIMIT EXCEEDED
input |
---|
1000000 832833 455297 341097 88590 258... |
correct output |
---|
16 |
user output |
---|
(empty) |
Test 6
Verdict: TIME LIMIT EXCEEDED
input |
---|
1000000 635299 635243 476863 88031 195... |
correct output |
---|
73 |
user output |
---|
(empty) |
Test 7
Verdict: TIME LIMIT EXCEEDED
input |
---|
1000000 444011 366349 710148 901981 81... |
correct output |
---|
244 |
user output |
---|
(empty) |
Test 8
Verdict: ACCEPTED
input |
---|
1000000 248398 271880 881725 521008 33... |
correct output |
---|
332 |
user output |
---|
332 |
Test 9
Verdict: ACCEPTED
input |
---|
999999 938280 731633 536902 381480 65... |
correct output |
---|
6771 |
user output |
---|
6771 |
Test 10
Verdict: TIME LIMIT EXCEEDED
input |
---|
999999 196127 288846 245904 406819 13... |
correct output |
---|
105 |
user output |
---|
(empty) |