# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
31735 | top34051 | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 249 ms | 100624 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 inf 1e9
#define maxn 30005
struct node {
int x,val;
node(int _x = 0,int _val = 0) {
x = _x; val = _val;
}
bool operator < (node a) const {
return a.val<val;
}
};
int n,m,st,ft;
int mem[maxn];
int last[maxn];
bool ok[175][maxn];
vector<pair<int,int> > from[maxn];
priority_queue<node> heap;
main() {
int i,j,x,y,pos,val,cnt;
scanf("%d%d",&n,&m);
for(i=0;i<m;i++) {
scanf("%d%d",&pos,&val);
if(i==0) st = pos;
if(i==1) ft = pos;
if(val>sqrt(n)) {
x = pos; cnt = 0;
while(x<n) {
from[pos].push_back({x,cnt});
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... |