| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 72255 |
2018-08-26T06:25:06 Z |
이시대의진정한갓겜스타투(#2216, kjp4155) |
Box Run (FXCUP3_box) |
C++17 |
|
468 ms |
48556 KB |
#include<bits/stdc++.h>
using namespace std;
#define VA_NUM_ARGS(...) VA_NUM_ARGS_IMPL_((0,__VA_ARGS__, 6,5,4,3,2,1))
#define VA_NUM_ARGS_IMPL_(tuple) VA_NUM_ARGS_IMPL tuple
#define VA_NUM_ARGS_IMPL(_0,_1,_2,_3,_4,_5,_6,N,...) N
#define macro_dispatcher(macro, ...) macro_dispatcher_(macro, VA_NUM_ARGS(__VA_ARGS__))
#define macro_dispatcher_(macro, nargs) macro_dispatcher__(macro, nargs)
#define macro_dispatcher__(macro, nargs) macro_dispatcher___(macro, nargs)
#define macro_dispatcher___(macro, nargs) macro ## nargs
#define Debug1(a) cout<<#a<<"="<<(a)<<"\n"
#define Debug2(a,b) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<"\n"
#define Debug3(a,b,c) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<"\n"
#define Debug4(a,b,c,d) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<"\n"
#define Debug5(a,b,c,d,e) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<", "<<#e<<"="<<(e)<<"\n"
#define Debug6(a,b,c,d,e,f) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<", "<<#e<<"="<<(e)<<", "<<#f<<"="<<(f)<<"\n"
#define Debug(...) macro_dispatcher(Debug, __VA_ARGS__)(__VA_ARGS__)
#define DA(a,n) cout<<#a<<"=["; printarray(a,n); cout<<"]\n"
#define DAR(a,n,s) cout<<#a<<"["<<s<<"-"<<n-1<<"]=["; printarray(a,n,s); cout<<"]\n"
#define TT1 template<class T>
#define TT1T2 template<class T1, class T2>
#define TT1T2T3 template<class T1, class T2, class T3>
template<class T, size_t N> ostream& operator << (ostream& os, const array<T, N>& v);
TT1T2 ostream& operator << (ostream& os, const pair<T1, T2>& p){ return os <<"("<<p.first<<", "<< p.second<<")"; }
TT1 ostream& operator << (ostream& os, const vector<T>& v){ bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
template<class T, size_t N> ostream& operator << (ostream& os, const array<T, N>& v) { bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const set<T1, T2>&v){ bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const multiset<T1,T2>&v){bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2T3 ostream& operator << (ostream& os, const map<T1,T2,T3>& v){ bool f = 1; os << "["; for (auto& ii : v) { if (!f)os << ", "; os << "(" << ii.first << " -> " << ii.second << ") "; f = 0; }return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const multimap<T1, T2>& v){ bool f = 1; os << "["; for (auto& ii : v) { if (!f)os << ", "; os << "(" << ii.first << " -> " << ii.second << ") "; f = 0; }return os << "]"; }
TT1T2 ostream& operator << (ostream& os, priority_queue<T1, T2> v) { bool f = 1; os << "["; while (!v.empty()) { auto x = v.top(); v.pop(); if (!f) os << ", "; f = 0; os << x; } return os << "]"; }
TT1T2 void printarray(const T1& a, T2 sz, T2 beg = 0){ for (T2 i = beg; i<sz; i++) cout << a[i] << " "; cout << endl; }
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
#define Fi first
#define Se second
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define rep(i, n) for(int i=0;i<n;i++)
#define repp(i, n) for(int i=1;i<=n;i++)
#define all(x) x.begin(), x.end()
#define geti1(X) cin >> X
#define geti2(X,Y) cin >> X >> Y
#define geti3(X,Y,Z) cin >> X >> Y >> Z
#define geti4(X,Y,Z,W) cin >> X >> Y >> Z >> W
#define GET_MACRO(_1,_2,_3,_4,NAME,...) NAME
#define geti(...) GET_MACRO(__VA_ARGS__, geti4, geti3, geti2, geti1) (__VA_ARGS__)
#define INF 987654321
#define endl '\n'
int mx[500500][20];
int pow2[50];
int N; int p[500500];
int ans[500500];
int query(int l, int r){
int k = 0;
int low = 0, high = 25;
while( low <= high ){
int mid = (low+high)/2;
if( pow2[mid] <= r-l+1 ){
k = mid; low = mid+1;
}
else{
high = mid-1;
}
}
return max( mx[l][k], mx[r-pow2[k]+1][k] );
}
int tmp[500500];
int main(){
scanf("%d",&N);
p[0] = 1e9;
repp(i,N) scanf("%d",&p[i]);
repp(i,N) tmp[i] = 1e9;
pow2[0] = 1;
repp(i,30) pow2[i] = pow2[i-1] * 2;
rep(i,N+1) mx[i][0] = p[i];
for(int k=1;k<=19;k++){
for(int i=0;i<=N;i++){
int npos = i + pow2[k-1];
if( npos > N ) npos = N;
mx[i][k] = max( mx[i][k-1] , mx[npos][k-1] );
}
}
for(int i=1;i<=N;i++){
int low = 0, high = i-1;
int res = -1;
while( low <= high ){
int mid = (low+high)/2;
int mx = query(mid,i-1);
if( mx >= p[i] ){
res = mid;
low = mid+1;
}
else high = mid-1;
}
if( res == -1 || i-res == 1 ) continue;
tmp[i-res-1] = min( tmp[i-res-1], i-1 );
}
//for(int i=1;i<=N;i++) printf("%d ",tmp[i]);
repp(i,N+10) ans[i] = 1e9;
for(int i=N;i>=1;i--){
ans[i] = min(ans[i+1], tmp[i]);
}
for(int i=1;i<=N;i++){
if( ans[i] >= 1e8 ) printf("-1 ");
else printf("%d ",ans[i]-i+1);
}
printf("\n");
}
Compilation message
box.cpp: In function 'int main()':
box.cpp:79:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&N);
~~~~~^~~~~~~~~
box.cpp:81:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
repp(i,N) scanf("%d",&p[i]);
~~~~~^~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
248 KB |
Output is correct |
| 2 |
Correct |
2 ms |
356 KB |
Output is correct |
| 3 |
Correct |
2 ms |
596 KB |
Output is correct |
| 4 |
Correct |
3 ms |
596 KB |
Output is correct |
| 5 |
Correct |
2 ms |
612 KB |
Output is correct |
| 6 |
Correct |
2 ms |
612 KB |
Output is correct |
| 7 |
Correct |
2 ms |
612 KB |
Output is correct |
| 8 |
Correct |
2 ms |
612 KB |
Output is correct |
| 9 |
Correct |
2 ms |
612 KB |
Output is correct |
| 10 |
Correct |
3 ms |
612 KB |
Output is correct |
| 11 |
Correct |
3 ms |
612 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
248 KB |
Output is correct |
| 2 |
Correct |
2 ms |
356 KB |
Output is correct |
| 3 |
Correct |
2 ms |
596 KB |
Output is correct |
| 4 |
Correct |
3 ms |
596 KB |
Output is correct |
| 5 |
Correct |
2 ms |
612 KB |
Output is correct |
| 6 |
Correct |
2 ms |
612 KB |
Output is correct |
| 7 |
Correct |
2 ms |
612 KB |
Output is correct |
| 8 |
Correct |
2 ms |
612 KB |
Output is correct |
| 9 |
Correct |
2 ms |
612 KB |
Output is correct |
| 10 |
Correct |
3 ms |
612 KB |
Output is correct |
| 11 |
Correct |
3 ms |
612 KB |
Output is correct |
| 12 |
Correct |
3 ms |
612 KB |
Output is correct |
| 13 |
Correct |
4 ms |
944 KB |
Output is correct |
| 14 |
Correct |
32 ms |
5012 KB |
Output is correct |
| 15 |
Correct |
58 ms |
7692 KB |
Output is correct |
| 16 |
Correct |
69 ms |
10236 KB |
Output is correct |
| 17 |
Correct |
201 ms |
25096 KB |
Output is correct |
| 18 |
Correct |
326 ms |
34460 KB |
Output is correct |
| 19 |
Correct |
352 ms |
43028 KB |
Output is correct |
| 20 |
Correct |
441 ms |
48556 KB |
Output is correct |
| 21 |
Correct |
468 ms |
48556 KB |
Output is correct |
