# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
146600 | karma | Jakarta Skyscrapers (APIO15_skyscraper) | C++11 | 243 ms | 67816 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 Task "test"
#define pb emplace_back
#define mp make_pair
using namespace std;
const int N = 30001;
const int Irene = int(1e9) + 7;
typedef pair<int, int> pii;
int n, m, u, dis, st, en, d[N];
set<int> jump[N];
vector<pii> a[N];
priority_queue<pii, vector<pii>, greater<pii>> pq;
void Enter()
{
cin >> n >> m;
for(int i = 0; i < m; ++i) {
cin >> u >> dis;
if(!i) st = u;
else if(i == 1) en = u;
jump[u].insert(dis);
}
for(int i = 0; i < n; ++i) {
for(int len: jump[i]) {
int irene = i, step = 0;
while(++step, (irene -= len) >= 0) {
a[i].pb(irene, step);
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... |