# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
531389 | lunchbox | Jakarta Skyscrapers (APIO15_skyscraper) | C++17 | 208 ms | 65936 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;
#define N 30000
#define INF 0x3f3f3f3f
vector<int> ed[N];
vector<pair<int, int>> ej[N];
bool find(int j, int d) {
auto it = lower_bound(ed[j].begin(), ed[j].end(), d);
return it != ed[j].end() && *it == d;
}
int main() {
static int dd[N];
int n, m, i, j, d, s, t;
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int,int>>> pq;
scanf("%d%d", &n, &m);
s = t = -1;
for (i = 0; i < m; i++) {
scanf("%d%d", &j, &d);
if (i == 0)
s = j;
else if (i == 1)
t = j;
ed[j].push_back(d);
}
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... |