# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
45448 | RayaBurong25_1 | Jakarta Skyscrapers (APIO15_skyscraper) | C++17 | 555 ms | 121124 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 <stdio.h>
#include <vector>
#include <queue>
#include <algorithm>
#define INF 1000000007
int B[30005], P[30005];
int abs(int a)
{
return (a < 0)?-a:a;
}
long long Vis[30005][505];
typedef struct node node;
struct node
{
int u, j, t;
};
std::vector<int> J[30005];
std::queue<node> Q;
int main()
{
int N, M;
scanf("%d %d", &N, &M);
int i;
node p;
for (i = 0; i < M; i++)
{
scanf("%d %d", &B[i], &P[i]);
if (i == 0)
p = {B[i], P[i], 0};
else
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... |