# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
990694 | 2024-05-31T03:45:49 Z | vjudge1 | Dijamant (COI16_dijament) | C++17 | 124 ms | 3668 KB |
#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; return 0; } string s1; vector<string> v; while (1) { cin>>s1; if (s1==":") continue; if (s1==";") break; if (add.find(s1)==add.end()) { cout<<"greska"<<endl; return 0; } v.push_back(s1); } cout<<"ok"<<endl; add.insert(s); } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 352 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 352 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 352 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 124 ms | 3668 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |