# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
835992 | Nicolas125841 | Plahte (COCI17_plahte) | C++17 | 243 ms | 524288 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;
vector<bitset<80000>> sets(80000, bitset<80000>());
int main(){
cin.tie(NULL)->sync_with_stdio(false);
int n, m;
for(int i = 0; i < n; i++){
int lx, ly, ux, uy;
cin >> lx >> ly >> ux >> uy;
}
set<int> colors;
for(int i = 0; i < m; i++){
int x, y, c;
cin >> x >> y >> c;
assert(colors.find(c) == colors.end());
colors.insert(c);
cout << "0\n";
}
}
Compilation message (stderr)
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |