# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
108056 | oolimry | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 642 ms | 156996 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;
typedef pair<long long, int> ii;
typedef vector<ii> vii;
int main()
{
//freopen("i.txt","r",stdin);
long long n, m;
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
ii doges[m];
for(int i = 0;i < m;i++){
cin >> doges[i].first >> doges[i].second;
}
//return 0;
set<int> power[n];
for(int i = 0;i < m;i++){
power[doges[i].first].insert(doges[i].second);
}
set<ii> identical;
vii edges[n];
for(int i = 0;i < m;i++){
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... |