# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
41517 | wzy | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 342 ms | 153100 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 int long long
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
vector<pii> adj[300005];
int n, m;
set<int> p[300005];
long long d[300005];
int32_t main(){
scanf("%lld%lld" , &n, &m);
int target = -1;
int start = 0;
for(int i = 0 ; i <m ; i ++){
int b, x;
scanf("%lld%lld" , &b , &x);
p[b].insert(x);
if(i == 1){
target = b;
}
if(i == 0){
start = b;
}
}
for(int i = 0 ; i < n; i++){
for(auto t : p[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... |