# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
719851 | jcelin | Dijamant (COI16_dijament) | C++14 | 259 ms | 888 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;
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, n) FOR(i, 0, n)
int n, nod;
map<string, int> id;
bitset<1007> gph[1007], rv[1007], prec[1007], emp, ch;
bool check(){
FOR(i, 1, nod + 1) if(!emp[i]) if(((~gph[i] & prec[i]) & emp).count()) return 1;
return 0;
}
int main(){
cin >> n;
REP(i, n){
string cur, e;
cin >> cur >> e;
if(id[cur]){
while(1){
cin >> e;
if(e == ";") break;
}
cout << "greska\n";
continue;
}
emp.reset();
int fl = 1;
while(1){
cin >> e;
if(e == ";") break;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |