# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
332992 | Cantfindme | Jakarta Skyscrapers (APIO15_skyscraper) | C++17 | 490 ms | 46572 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
typedef pair<int,int> pi;
#define f first
#define s second
#define FAST ios_base::sync_with_stdio(0); cin.tie(0);
const int maxn = 30010;
const int INF = INT_MAX/2;
typedef pair<int, pi> pp;
int n,doges;
vector <int> bufflist[maxn];
vector <int> smalldogs[maxn];
const int len = 174;
int dist[maxn][len+10];
int stp,endp;
int32_t main() {
FAST
cin >> n >> doges;
for (int i =0;i<doges;i++) {
int pos, jump; cin >> pos >> jump;
if (i == 0) stp = pos;
if (i == 1) endp = pos;
# | 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... |