# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
162248 | rama_pang | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 813 ms | 63076 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;
int N, M;
vector<vector<pair<int, int>>> G; // first = destination, second = cost
vector<vector<int>> building;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> N >> M;
G.resize(N);
building.resize(N);
int start, end, p;
cin >> start >> p; building[start].emplace_back(p);
cin >> end >> p; building[end].emplace_back(p);
for (int i = 2; i < M; i++) {
int b, p;
cin >> b >> p;
building[b].emplace_back(p);
}
for (auto &n : building) {
sort(n.begin(), n.end());
n.resize(unique(n.begin(), n.end()) - n.begin());
}
# | 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... |