# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
882773 | mychecksedad | Jakarta Skyscrapers (APIO15_skyscraper) | C++17 | 244 ms | 135252 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.
/* Author : Mychecksdead */
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define pb push_back
#define all(x) x.begin(), x.end()
#define en cout << '\n'
const int N = 1e6+100, M = 1e5+10, K = 52, MX = 30;
int n, m;
vector<pair<int, int>> g[N];
bitset<30005> vis[30005];
vector<bool> VIS(N);
void solve(){
cin >> n >> m;
int z = 0, aim;
for(int i = 1; i <= m; ++i){
int b, p; cin >> b >> p;
if(i==1) z = b;
if(i==2) aim = b;
g[b].pb({i, p});
}
deque<array<int, 3>> q;
for(auto x: g[z]) q.pb({0, z, x.second}), vis[z][x.second] = 1;
VIS[z] = 1;
while(!q.empty()){
auto v = q.front(); q.pop_front();
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... |