# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
31249 | nibnalin | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 273 ms | 7292 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 <cstdio>
#include <vector>
#include <set>
#include <cmath>
#include <algorithm>
using namespace std;
const int inf = int(1e9)+5, maxn = int(3e4)+5;
int B[maxn], P[maxn], D[maxn][2];
vector<pair<int, int>> doge[maxn];
// 0 => doge
// 1 => skyscraper
bool go(int x, int y)
{
if(B[x] == y) return 0;
auto it = lower_bound(doge[y].begin(), doge[y].end(), make_pair(P[x], -1));
return (it != doge[y].end() && it->first == P[x]);
}
int main(void)
{
int n, m;
scanf("%d%d", &n, &m);
for(int i = 0;i < m;i++)
{
scanf("%d%d", &B[i], &P[i]), D[i][0] = inf;
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... |