# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
145109 | MihneaHedea | Cover (COCI18_cover) | C++14 | 16 ms | 1912 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 <set>
using namespace std;
struct elem {
long long x;
long long y;
};
struct dreptunghi {
long long dimx;
long long dimy;
};
set<pair<long long, long long> > s;
elem v[20010];
dreptunghi d[20010];
long long dp[20010];
long long n, k, i, x, y, minim, maxim, sol;
int main () {
cin>>n;
for (i=1;i<=n;i++) {
cin>>x>>y;
s.insert(make_pair(x, y));
s.insert(make_pair(-x, y));
s.insert(make_pair(x, -y));
s.insert(make_pair(-x, -y));
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |