Submission #51045723

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define md(a) a=(a%mod+mod)%mod
#define file(a) freopen(#a".in","r",stdin);freopen(#a".out","w",stdout)

/*
inline int qp(int a,int n){int b=1;while(n){if(n&1)b=b*a%mod;a=a*a%mod,n>>=1;}return b;}
struct BIT
{
	int c[N],upd;
	inline void init(int n){upd=n;for(int i=0;i<=upd;i++)c[i]=0;}
	inline void add(int x,int d){for(;x<=upd;x+=(x&-x))c[x]+=d;}
	inline int ask(int x){int w=0;for(;x;x-=(x&-x))w+=c[x];return w;}
}T;
struct Seg{int l,r,dat;}tree[N*4];
inline void pushup(int v){tree[v].dat=max(tree[v*2].dat,tree[v*2+1].dat);}
void build(int v,int l,int r)
{
	tree[v]={l,r,0};if(l==r)return ;
	int mid=(l+r)>>1;build(v*2,l,mid),build(v*2+1,mid+1,r);
}
void add(int v,int x,int d)
{
	if(tree[v].l==tree[v].r)return void(tree[v].dat=d);
	int mid=(tree[v].l+tree[v].r)>>1;add(v*2+(x>mid),x,d),pushup(v);
}
int ask(int v,int l,int r)
{
	if(l<=tree[v].l&&tree[v].r<=r)return tree[v].dat;int mid=(tree[v].l+tree[v].r)>>1,w=0;
	if(l<=mid)w=max(w,ask(v*2,l,r));if(r>mid)w=max(w,ask(v*2+1,l,r));return w;
}
*/
const int N=400005;
int n,a[N],Q;map<int,int>mp;
int nxt[N],pre[N];
signed main()
{
	scanf("%d",&n);for(int i=1;i<=n;i++)scanf("%d",&a[i]);
	for(int i=0;i<=n+1;i++)nxt[i]=i+1,pre[i]=i-1,mp[a[i]]=i;n++;
	int del=n;
	cin>>Q;
	while(Q--)
	{
		int op,x,y;scanf("%d%d",&op,&x);
		if(op==1)
		{
			scanf("%d",&y),n++,a[n]=y,mp[y]=n;y=n;
			int p=mp[x],q=nxt[p];nxt[p]=y,pre[y]=p,nxt[y]=q,pre[q]=y;
		}
		else
		{
			x=mp[x];int p=pre[x],q=nxt[x];
			nxt[p]=q,pre[q]=p;
		}
	}
	int now=0;
	while(1)
	{
		now=nxt[now];if(now==del)break;
		printf("%d ",a[now]);
	}
	return 0;
}

Submission Info

Compile Error

Main.cpp: In function ‘int main()’:
Main.cpp:40:9: warning: this ‘for’ clause does not guard... [-Wmisleading-indentation]
   40 |         for(int i=0;i<=n+1;i++)nxt[i]=i+1,pre[i]=i-1,mp[a[i]]=i;n++;
      |         ^~~
Main.cpp:40:65: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘for’
   40 |         for(int i=0;i<=n+1;i++)nxt[i]=i+1,pre[i]=i-1,mp[a[i]]=i;n++;
      |                                                                 ^
Main.cpp:39:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   39 |         scanf("%d",&n);for(int i=1;i<=n;i++)scanf("%d",&a[i]);
      |         ~~~~~^~~~~~~~~
Main.cpp:39:50: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   39 |         scanf("%d",&n);for(int i=1;i<=n;i++)scanf("%d",&a[i]);
      |                                             ~~~~~^~~~~~~~~~~~
Main.cpp:45:33: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   45 |                 int op,x,y;scanf("%d%d",&op,&x);
      |                            ~~~~~^~~~~~~~~~~~~~~
Main.cpp:48:30: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   48 |                         scanf("%d",&y),n++,a[n]=y,mp[y]=n;y=n;
      |                         ~~~~~^~~~~~~~~

Judge Result