Submission #74322

#TimeUsernameProblemLanguageResultExecution timeMemory
74322cheetoseBox Run (FXCUP3_box)C++11
0 / 100
4 ms2428 KiB
#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 1987654321 #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 = 1000000009; 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 ans[500001]; int main() { stack<Pi> st; MEM_1(ans); st.push(mp(INF,0)); int n; scanf("%d",&n); fup(i,1,n,1) { int x; scanf("%d",&x); if(st.top().X>=x)st.push(mp(x,i)); else { while(st.top().X<x) { st.pop(); int t=i-st.top().Y-1; if(ans[t]==-1)ans[t]=st.top().Y+1; } st.push(mp(x,i)); } } fdn(i,n-1,1,1) if(ans[i]==-1&&ans[i+1]!=-1)ans[i]=ans[i+1]+1; fup(i,1,n,1)printf("%d ",ans[i]); }

Compilation message (stderr)

box.cpp: In function 'int main()':
box.cpp:66:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
box.cpp:70:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&x);
   ~~~~~^~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...