| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 75027 |
2018-09-08T04:51:15 Z |
cheetose |
Box Run (FXCUP3_box) |
C++11 |
|
1000 ms |
70364 KB |
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>
#include<list>
#include<functional>
#include<cassert>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define INF 987654321
#define PI 3.14159265358979323846264
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset(a,0,sizeof(a));
#define MEM_1(a) memset(a,-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const int MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) { ll ret = 1; for (; b; b >>= 1, a = (a*a) % MMM)if (b & 1)ret = (ret*a) % MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1 }, dy[] = { 1,0,-1,0 };
int ddx[] = { 0,0,1,1,1,-1,-1,-1 }, ddy[] = { 1,-1,1,0,-1,1,0,-1 };
int a[500000];
map<int,int> M;
Vi v[500000];
int ans[500000];
set<Pi> S;
Vi vv;
int main() {
fill(ans,ans+500000,INF);
int n;
scanf("%d",&n);
fup(i,0,n-1,1)
{
scanf("%d",a+i);
vv.pb(a[i]);
}
sort(ALL(vv));
vv.resize(unique(ALL(vv))-vv.begin());
int N=vv.size();
fup(i,0,N-1,1)M[vv[i]]=i;
fup(i,0,n-1,1)a[i]=M[a[i]];
fup(i,0,n-1,1)v[a[i]].pb(i);
S.insert(mp(n-1,0));
fdn(i,N-1,0,1)
{
int nn=v[i].size();
fup(j,0,nn-1,1)
{
int t=v[i][j];
auto it=S.lower_bound(mp(t,-1));
int L=it->Y,R=it->X;
S.erase(it);
int ll=L,rr=t-1;
if(ll<=rr)
{
int as=rr-ll;
if(rr!=n-1)ans[as]=min(ans[as],rr+1);
S.insert(mp(rr,ll));
}
ll=t+1,rr=R;
if(ll<=rr)
{
int as=rr-ll;
if(rr!=n-1)ans[as]=min(ans[as],rr+1);
S.insert(mp(rr,ll));
}
}
}
fdn(i,n-2,0,1)ans[i]=min(ans[i],ans[i+1]);
fup(i,0,n-1,1)printf("%d ",ans[i]==INF?-1:ans[i]-i);
}
Compilation message
box.cpp: In function 'int main()':
box.cpp:69:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n);
~~~~~^~~~~~~~~
box.cpp:72:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",a+i);
~~~~~^~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
14 ms |
14072 KB |
Output is correct |
| 2 |
Correct |
15 ms |
14072 KB |
Output is correct |
| 3 |
Correct |
17 ms |
14328 KB |
Output is correct |
| 4 |
Correct |
15 ms |
14328 KB |
Output is correct |
| 5 |
Correct |
15 ms |
14328 KB |
Output is correct |
| 6 |
Correct |
15 ms |
14328 KB |
Output is correct |
| 7 |
Correct |
15 ms |
14328 KB |
Output is correct |
| 8 |
Correct |
17 ms |
14328 KB |
Output is correct |
| 9 |
Correct |
14 ms |
14328 KB |
Output is correct |
| 10 |
Correct |
14 ms |
14328 KB |
Output is correct |
| 11 |
Correct |
14 ms |
14388 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
14 ms |
14072 KB |
Output is correct |
| 2 |
Correct |
15 ms |
14072 KB |
Output is correct |
| 3 |
Correct |
17 ms |
14328 KB |
Output is correct |
| 4 |
Correct |
15 ms |
14328 KB |
Output is correct |
| 5 |
Correct |
15 ms |
14328 KB |
Output is correct |
| 6 |
Correct |
15 ms |
14328 KB |
Output is correct |
| 7 |
Correct |
15 ms |
14328 KB |
Output is correct |
| 8 |
Correct |
17 ms |
14328 KB |
Output is correct |
| 9 |
Correct |
14 ms |
14328 KB |
Output is correct |
| 10 |
Correct |
14 ms |
14328 KB |
Output is correct |
| 11 |
Correct |
14 ms |
14388 KB |
Output is correct |
| 12 |
Correct |
15 ms |
14408 KB |
Output is correct |
| 13 |
Correct |
17 ms |
14588 KB |
Output is correct |
| 14 |
Correct |
126 ms |
19628 KB |
Output is correct |
| 15 |
Correct |
174 ms |
23124 KB |
Output is correct |
| 16 |
Correct |
224 ms |
26864 KB |
Output is correct |
| 17 |
Correct |
710 ms |
45348 KB |
Output is correct |
| 18 |
Correct |
994 ms |
59072 KB |
Output is correct |
| 19 |
Execution timed out |
1081 ms |
70364 KB |
Time limit exceeded |
| 20 |
Halted |
0 ms |
0 KB |
- |
