#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int M,N ;
cin >> M >> N ;
vector<int> Data ;
Data.push_back(0);
bool IsCactus = true ;
for( int i = 0; i < N ; i++ )
{
int oneVert, twoVert = 0;
cin >> oneVert >> twoVert ;
vector<int>::iterator it =
find(Data.begin(), Data.end(), twoVert) ;
if( it != Data.end() )
{
IsCactus = false;
}
Data.push_back( twoVert ) ;
}
if ( IsCactus )
cout << "Cactus" ;
else
cout << "Not cactus" ;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
1672 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |