| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 4217 | dbfud | Cactus? Not cactus? (kriii1_C) | C++98 | 0 ms | 1672 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
} 
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
