# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
100982 | 2019-03-15T16:46:05 Z | KLPP | Wand (COCI19_wand) | C++14 | 96 ms | 26232 KB |
#include<bits/stdc++.h> using namespace std; typedef long long int lld; vector<int> nei[1000000]; bool visited[1000000]; void DFS(int node){ //ut<<node<<" "; for(int i=0;i<nei[node].size();i++){ if(!visited[nei[node][i]]){ visited[nei[node][i]]=true; DFS(nei[node][i]); } } } int main(){ int n,m; scanf("%d %d",&n,&m); for(int i=0;i<m;i++){ int x,y; scanf("%d %d",&x,&y); x--;y--; nei[y].push_back(x); } for(int i=0;i<n;i++){ DFS(i); //ut<<endl; } for(int i=0;i<n;i++){ cout<<visited[i]; }cout<<endl; return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 25 ms | 23808 KB | Output isn't correct |
2 | Correct | 27 ms | 23800 KB | Output is correct |
3 | Incorrect | 72 ms | 25976 KB | Output isn't correct |
4 | Incorrect | 91 ms | 25976 KB | Output isn't correct |
5 | Incorrect | 78 ms | 25976 KB | Output isn't correct |
6 | Incorrect | 88 ms | 26032 KB | Output isn't correct |
7 | Incorrect | 90 ms | 26024 KB | Output isn't correct |
8 | Incorrect | 82 ms | 26104 KB | Output isn't correct |
9 | Incorrect | 88 ms | 26232 KB | Output isn't correct |
10 | Incorrect | 96 ms | 26156 KB | Output isn't correct |