# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
103860 | E869120 | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 354 ms | 154116 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 <iostream>
#include <vector>
#include <map>
#include <queue>
#include <ctime>
#include <cassert>
using namespace std;
#pragma warning (disable: 4996)
const int MAX_N = 1000000;
vector<pair<int, int>>X[30009]; map<int, int>Map[30009], Map2[30009];
int N, M, B[30009], P[30009], dist[30009], cntv; unsigned int Z[35000000];
vector<int>Q[MAX_N];
int check(int p1, int p2) {
if ((Z[p1 * 1024 + (p2 >> 5)] & (1U << (p2 & 31))) == 0) return 0;
return 1;
}
int main() {
srand((unsigned)time(NULL));
cin >> N >> M;
for (int i = 0; i < M; i++) {
scanf("%d%d", &B[i], &P[i]);
Z[(B[i] * 1024 + (P[i] >> 5))] |= (1U << (P[i] & 31));
}
for (int i = 0; i < M; i++) {
if (Map2[B[i]][P[i]] == 1) continue;
int cnt = 0;
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... |