# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
25700 | gabrielsimoes | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 153 ms | 8400 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 <cstdio>
#include <vector>
#include <queue>
#include <tuple>
#include <algorithm>
#include <limits>
using namespace std;
vector<int> ps[30000];
int dis[30000];
int main() {
int n, m;
scanf("%d %d", &n, &m);
int s, t;
for(int i = 0; i < m; i++) {
int b, p;
scanf("%d %d", &b, &p);
ps[b].push_back(p);
if(i == 0)
s = b;
else if(i == 1)
t = b;
}
for(int i = 0; i < n; i++) {
vector<int>& v = ps[i];
sort(v.begin(), v.end());
v.erase(unique(v.begin(), v.end()), v.end());
}
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... |