# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
960681 | 3omar_ahmed | Jakarta Skyscrapers (APIO15_skyscraper) | C++17 | 99 ms | 190292 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 endl '\n'
#define all(a) a.begin() , a.end()
#define alr(a) a.rbegin() , a.rend()
signed main(){
ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0);
int n, m;
cin >> n >> m;
pair < int , int > first, second;
vector < vector < int >> arr(1 + n);
for(int i = 0 ; i < m ; i++) {
int a, b;
cin >> a >> b;
if(i == 0) {
first = {a, b};
} else if(i == 1) {
second = {a, b};
}
arr[a].push_back(b);
}
int nodes = ((n + 1) * (n + 1)) + 5;
vector < vector < pair < int , int >>> adj(nodes);
for(int i = 0 ; i < n ; i++) {
for(auto j : arr[i]) {
int node = (i * (n + 1) + j);
adj[i * (n + 1) + n + 1].push_back({node, 0});
# | 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... |