# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
109591 | arman_ferdous | Jakarta Skyscrapers (APIO15_skyscraper) | C++17 | 368 ms | 65892 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.
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
const int N = 30010;
const int oo = 1e8;
using ii = pair<int,int>;
int n, m, st, ft;
vector<int> f[N];
int dist[N];
vector<ii> g[N];
priority_queue<ii, vector<ii>, greater<ii> > q;
bool has(int b, int p) {
int lo = 0, hi = (int)f[b].size() - 1;
while(lo <= hi) {
int mid = (lo + hi) >> 1;
if(f[b][mid] == p) return true;
if(f[b][mid] < p) lo = mid+1;
else hi = mid-1;
} return false;
}
int main() {
scanf("%d %d", &n, &m);
for(int i = 0; i < m; ++i) {
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... |