# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
466710 | ronnith | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 259 ms | 80592 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 int N = (int)3e4, M = (int)3e4;
int n, m;
array<int, 2> doge[M];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> m;
set<int> P;
vector<int> ind;
for(int i = 0;i < m;i ++) {
int b, p;
cin >> b >> p;
P.insert(p);
doge[i] = {b, p};
}
for(auto& e: P) ind.push_back(e);
auto id = [&](int x) {
return lower_bound(ind.begin(), ind.end(), x) - ind.begin();
};
vector<set<int>> pos(n);
for(int i = 0;i < m;i ++) {
pos[doge[i][0]].insert(id(doge[i][1]));
}
vector<vector<pair<int, int>>> adj(n);
set<array<int, 2>> same;
# | 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... |