# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
861613 | anha3k25cvp | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 121 ms | 262144 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>
#define ll long long
#define ull unsigned long long
#define dl double
#define st first
#define nd second
#define II pair <int, int>
using namespace std;
const int N = 5 + 1e5;
const int inf = 7 + 1e9;
int n, m;
vector <int> b, p;
namespace subtask123 {
void main() {
vector <vector <int>> g(n);
for (int i = 1; i <= m; i ++)
g[b[i]].push_back(i);
vector <vector <II>> adj(m + 1);
for (int i = 1; i <= m; i ++) {
if (p[i] == 0)
continue;
int x = b[i], w = 0;
while (x >= 0) {
for (int j : g[x])
adj[i].push_back({j, w});
x -= 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... |