# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1090298 | maxFedorchuk | Star triangles (IZhO11_triangle) | C++17 | 454 ms | 77204 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;
const long long MX=3e5+10;
long long x[MX],y[MX];
long long n;
void compr(long long *o)
{
map < long long , long long > mp;
for(long long i=1;i<=n;i++)
{
mp[o[i]]=1;
}
long long uk=0;
for(auto & u:mp)
{
uk++;
u.second=uk;
}
for(long long i=1;i<=n;i++)
{
o[i]=mp[o[i]];
}
}
set < pair < long long , long long > > corgor[MX];
set < pair < long long , long long > > corver[MX];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |