| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 144409 | vladciuperceanu | Cover (COCI18_cover) | C++14 | 16 ms | 2040 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>
#define xx first
#define yy second
using namespace std;
int n,i,j,x,y;
long long d[20005];
pair<long long, long long> v[20005],drept[20005];
set< pair<long long, long long> > s;
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));
}
int m = 0;
for (set< pair<long long, long long> >::iterator it=s.begin(); it!=s.end(); it++)
v[++m] = make_pair(it->first, it->second);
long long minim = v[1].yy; long long maxim = v[1].yy; int k = 0;
for (i=2; i<=m; i++)
{
if (v[i].xx >= 0)
break;
if (v[i].xx == v[i-1].xx)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||