# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
47261 | yusufake | Jakarta Skyscrapers (APIO15_skyscraper) | C++98 | 399 ms | 210612 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 pb push_back
#define mp make_pair
#define st first
#define nd second
const int N = 3e4 + 4;
const int kok = 177;
typedef long long ll;
typedef pair < int , int > pp;
vector < pp > Q[N*kok];
vector < int > V[N];
int H[N][kok],F[N],beg[N],jum[N],n,m,i,j,x,u,res,ss;
void f(int x, int u, int t){
if(u >= kok){
for(int i=0;i<kok;i++){
if(x + i*u < n && !H[x+i*u][0])
ss++, Q[t+i].pb(mp(x+i*u,0));
if(x - i*u >= 0 && !H[x-i*u][0])
ss++, Q[t+i].pb(mp(x-i*u,0));
}
}
else if(!H[x][u]) ss++, Q[t].pb(mp(x,u));
}
int main(){
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... |