# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
990696 | vjudge1 | Dijamant (COI16_dijament) | C++17 | 0 ms | 0 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 <bits/stdc++.h>
using namespace std;
int main()
{
set<string> add;
int n;
cin>>n;
// bitset<1000> inh[n],der[n];
while (n--)
{
string s;
cin>>s;
if (add.find(s)!=add.end())
{
cout<<"greska"<<endl;
continue;
}
string s1;
while (1)
{
cin>>s1;
if (s1==":")
continue;
if (s1==";")
break;
if (add.find(s1)==add.end())
{
cout<<"greska"<<endl;
goto sad;
}
}
cout<<"ok"<<endl;
add.insert(s);
sad:
}
return 0;
}