Hi Mike, I’m appealing the situation where Kylume’s contest result was skipped and unrated. We’re confused by this judgment and ask for detailed violation explanations.↵
↵
Kylume receives professional algorithm training in Macau and has solid contest skills. He even got 1st place in MOIC2026 and qualified for the Macau IOI team. with his real strength, which fully proves his ability.↵
↵
Please note that his low rating is totally misleading. He rarely participates in these competitions so his low rating isn't a sign of cheating.↵
↵
After the competition, he showed me the code, and I thoughtink there weare no problems.↵
↵
```cpp↵
#include<bits/stdc++.h>↵
#define int long long↵
#define double long double↵
using namespace std;↵
int T,n,a[110];↵
signed main(){↵
ios::sync_with_stdio(false);↵
cin.tie(0),cout.tie(0);↵
cin>>T;↵
while(T--){↵
cin>>n;↵
unordered_map<int,int> mp,vis;↵
int cnt=1e18;↵
for(int i=1;i<=n;i++) cin>>a[i],mp[a[i]]++;↵
sort(a+1,a+1+n);↵
for(int i=1;i<=n;i++){↵
if(vis[a[i]]) continue;↵
vis[a[i]]=1;↵
int l=i-1,r=n-(i+mp[a[i]]-1);↵
cnt=min(cnt,max(l,r));↵
}↵
cout<<cnt<<endl;↵
}↵
return 0;↵
}↵
```↵
```cpp↵
#include<bits/stdc++.h>↵
#define int long long↵
#define double long double↵
using namespace std;↵
int T,n;↵
signed main(){↵
ios::sync_with_stdio(false);↵
cin.tie(0),cout.tie(0);↵
cin>>T;↵
while(T--){↵
cin>>n;↵
vector<int> a(n+1);↵
for(int i=1;i<=n;i++) cin>>a[i];↵
int minn=1e18;↵
int s=0;↵
for(int i=1;i<=n;i++){↵
s+=a[i];minn=min(minn,s/i);↵
cout<<minn<<" ";↵
}↵
cout<<endl;↵
}↵
return 0;↵
}↵
```↵
↵
```cpp↵
#include<bits/stdc++.h>↵
#define int long long↵
#define double long double↵
using namespace std;↵
int T,n,x,s;↵
signed main(){↵
ios::sync_with_stdio(false);↵
cin.tie(0),cout.tie(0);↵
cin>>T;↵
while(T--){↵
cin>>n>>x>>s;↵
string st;↵
cin>>st;↵
int o=0,cnt=0,ae=0;↵
for(auto c:st){↵
if(c=='I'){↵
if(o<x) o++,cnt++;↵
}↵
else if(c=='E'){↵
if(o*s>cnt) cnt++;↵
else if(ae>0&&o<x){↵
ae--;o++,cnt++;↵
}↵
}↵
else if(c=='A'){↵
if(o*s>cnt){cnt++,ae++;}↵
else if(o<x){o++,cnt++;}↵
}↵
}↵
cout<<cnt<<endl;↵
}↵
return 0;↵
}↵
```↵
```cpp↵
#include<bits/stdc++.h>↵
#define int long long↵
#define double long double↵
using namespace std;↵
const int mod=1e9+7;↵
int fac[5010],inv[5010];↵
int ksm(int a,int b=mod-2){↵
int ans=1;↵
a%=mod;↵
while(b){↵
if(b%2) ans=ans*a%mod;↵
a=a*a%mod;b/=2;↵
}↵
return ans;↵
}↵
int C(int n,int m){↵
if(m<0||n<m) return 0;↵
return fac[n]*inv[m]%mod*inv[n-m]%mod;↵
}↵
struct snake{↵
int v,p;↵
string s;↵
snake(){};↵
snake(int x,int y,string st){↵
v=x,p=y,s=st;↵
}↵
};↵
bool cmp(snake x,snake y){↵
return x.p<y.p;↵
}↵
bool flag[5010];↵
struct node{↵
bool f1;↵
int e,v,l,r;↵
string mv;↵
};↵
struct res{↵
int w,ct,e;↵
};↵
vector<snake> a;↵
vector<node> t;↵
vector<int> cnt;↵
int build(int l,int r,int pl,int pr){↵
int id=t.size();↵
t.push_back({});↵
if(l>r){↵
t[id].f1=1;t[id].e=max(0ll,pr-pl+1);↵
return id;↵
}↵
int mid=l;↵
for(int i=l+1;i<=r;i++) if(a[i].v>a[mid].v) mid=i;↵
t[id].f1=0,t[id].v=a[mid].v,t[id].mv=a[mid].s;↵
t[id].l=build(l,mid-1,pl,a[mid].p-1);↵
t[id].r=build(mid+1,r,a[mid].p+1,pr);↵
return id;↵
}↵
res dfs(int u){↵
if(t[u].f1){↵
if(t[u].e<cnt[u]) return {0,cnt[u],t[u].e};↵
return {fac[t[u].e],cnt[u],t[u].e};↵
}↵
res l=dfs(t[u].l),r=dfs(t[u].r);↵
int e=l.e+r.e,ct=l.ct+r.ct+cnt[u];↵
if(e<ct||l.e<l.ct||r.e<r.ct) return {0,ct,e};↵
int w=(l.w*r.w%mod*C(l.e-l.ct+r.e-r.ct,l.e-l.ct))%mod;↵
return {w,ct,e};↵
}↵
void solve(){↵
int n,k;↵
cin>>n>>k;↵
for(int i=1;i<=n;i++) flag[i]=0;↵
a.clear();t.clear();cnt.clear();↵
for(int i=1;i<=k;i++){↵
int s,r,c;string st;cin>>s>>r>>c;if(s!=1) cin>>st;↵
int pos=r;↵
for(int j=0;j<(s+1)/2-1;j++) if(st[j]=='D') pos++;↵
a.push_back(snake((s+1)/2,pos-1,st));↵
flag[(s+1)/2]=1;↵
}↵
sort(a.begin(),a.end(),cmp);↵
int root=build(0,k-1,0,n-1);cnt.resize(t.size());↵
for(int i=1;i<=n;i++){↵
if(flag[i]) continue;↵
int nw=root;↵
while(!t[nw].f1&&t[nw].v>i)↵
if(t[nw].mv[t[nw].v-1-i]=='D')↵
nw=t[nw].l;↵
else nw=t[nw].r;↵
cnt[nw]++;↵
}↵
res ans=dfs(root);↵
cout<<ans.w<<endl;↵
}↵
signed main(){↵
ios::sync_with_stdio(false);↵
cin.tie(0),cout.tie(0);↵
fac[0]=inv[0]=1;↵
for(int i=1;i<=5005;i++)↵
fac[i]=fac[i-1]*i%mod;↵
inv[5005]=ksm(fac[5005]);↵
for(int i=5004;i>=1;i--) inv[i]=inv[i+1]*(i+1)%mod;↵
int t;↵
cin>>t;↵
while(t--){solve();}↵
return 0;↵
}↵
```↵
↵
We sincerely ask the team to recheck his contest records, cancel the skipped status, and provide specific reasons and evidence for this judgment. Hope for a fair re-evaluation!
↵
Kylume receives professional algorithm training in Macau and has solid contest skills. He even got 1st place in MOIC2026 and qualified for the Macau IOI team. with his real strength, which fully proves his ability.↵
↵
Please note that his low rating is totally misleading. He rarely participates in these competitions so his low rating isn't a sign of cheating.↵
↵
After the competition, he showed me the code, and I th
↵
```cpp↵
#include<bits/stdc++.h>↵
#define int long long↵
#define double long double↵
using namespace std;↵
int T,n,a[110];↵
signed main(){↵
ios::sync_with_stdio(false);↵
cin.tie(0),cout.tie(0);↵
cin>>T;↵
while(T--){↵
cin>>n;↵
unordered_map<int,int> mp,vis;↵
int cnt=1e18;↵
for(int i=1;i<=n;i++) cin>>a[i],mp[a[i]]++;↵
sort(a+1,a+1+n);↵
for(int i=1;i<=n;i++){↵
if(vis[a[i]]) continue;↵
vis[a[i]]=1;↵
int l=i-1,r=n-(i+mp[a[i]]-1);↵
cnt=min(cnt,max(l,r));↵
}↵
cout<<cnt<<endl;↵
}↵
return 0;↵
}↵
```↵
```cpp↵
#include<bits/stdc++.h>↵
#define int long long↵
#define double long double↵
using namespace std;↵
int T,n;↵
signed main(){↵
ios::sync_with_stdio(false);↵
cin.tie(0),cout.tie(0);↵
cin>>T;↵
while(T--){↵
cin>>n;↵
vector<int> a(n+1);↵
for(int i=1;i<=n;i++) cin>>a[i];↵
int minn=1e18;↵
int s=0;↵
for(int i=1;i<=n;i++){↵
s+=a[i];minn=min(minn,s/i);↵
cout<<minn<<" ";↵
}↵
cout<<endl;↵
}↵
return 0;↵
}↵
```↵
↵
```cpp↵
#include<bits/stdc++.h>↵
#define int long long↵
#define double long double↵
using namespace std;↵
int T,n,x,s;↵
signed main(){↵
ios::sync_with_stdio(false);↵
cin.tie(0),cout.tie(0);↵
cin>>T;↵
while(T--){↵
cin>>n>>x>>s;↵
string st;↵
cin>>st;↵
int o=0,cnt=0,ae=0;↵
for(auto c:st){↵
if(c=='I'){↵
if(o<x) o++,cnt++;↵
}↵
else if(c=='E'){↵
if(o*s>cnt) cnt++;↵
else if(ae>0&&o<x){↵
ae--;o++,cnt++;↵
}↵
}↵
else if(c=='A'){↵
if(o*s>cnt){cnt++,ae++;}↵
else if(o<x){o++,cnt++;}↵
}↵
}↵
cout<<cnt<<endl;↵
}↵
return 0;↵
}↵
```↵
```cpp↵
#include<bits/stdc++.h>↵
#define int long long↵
#define double long double↵
using namespace std;↵
const int mod=1e9+7;↵
int fac[5010],inv[5010];↵
int ksm(int a,int b=mod-2){↵
int ans=1;↵
a%=mod;↵
while(b){↵
if(b%2) ans=ans*a%mod;↵
a=a*a%mod;b/=2;↵
}↵
return ans;↵
}↵
int C(int n,int m){↵
if(m<0||n<m) return 0;↵
return fac[n]*inv[m]%mod*inv[n-m]%mod;↵
}↵
struct snake{↵
int v,p;↵
string s;↵
snake(){};↵
snake(int x,int y,string st){↵
v=x,p=y,s=st;↵
}↵
};↵
bool cmp(snake x,snake y){↵
return x.p<y.p;↵
}↵
bool flag[5010];↵
struct node{↵
bool f1;↵
int e,v,l,r;↵
string mv;↵
};↵
struct res{↵
int w,ct,e;↵
};↵
vector<snake> a;↵
vector<node> t;↵
vector<int> cnt;↵
int build(int l,int r,int pl,int pr){↵
int id=t.size();↵
t.push_back({});↵
if(l>r){↵
t[id].f1=1;t[id].e=max(0ll,pr-pl+1);↵
return id;↵
}↵
int mid=l;↵
for(int i=l+1;i<=r;i++) if(a[i].v>a[mid].v) mid=i;↵
t[id].f1=0,t[id].v=a[mid].v,t[id].mv=a[mid].s;↵
t[id].l=build(l,mid-1,pl,a[mid].p-1);↵
t[id].r=build(mid+1,r,a[mid].p+1,pr);↵
return id;↵
}↵
res dfs(int u){↵
if(t[u].f1){↵
if(t[u].e<cnt[u]) return {0,cnt[u],t[u].e};↵
return {fac[t[u].e],cnt[u],t[u].e};↵
}↵
res l=dfs(t[u].l),r=dfs(t[u].r);↵
int e=l.e+r.e,ct=l.ct+r.ct+cnt[u];↵
if(e<ct||l.e<l.ct||r.e<r.ct) return {0,ct,e};↵
int w=(l.w*r.w%mod*C(l.e-l.ct+r.e-r.ct,l.e-l.ct))%mod;↵
return {w,ct,e};↵
}↵
void solve(){↵
int n,k;↵
cin>>n>>k;↵
for(int i=1;i<=n;i++) flag[i]=0;↵
a.clear();t.clear();cnt.clear();↵
for(int i=1;i<=k;i++){↵
int s,r,c;string st;cin>>s>>r>>c;if(s!=1) cin>>st;↵
int pos=r;↵
for(int j=0;j<(s+1)/2-1;j++) if(st[j]=='D') pos++;↵
a.push_back(snake((s+1)/2,pos-1,st));↵
flag[(s+1)/2]=1;↵
}↵
sort(a.begin(),a.end(),cmp);↵
int root=build(0,k-1,0,n-1);cnt.resize(t.size());↵
for(int i=1;i<=n;i++){↵
if(flag[i]) continue;↵
int nw=root;↵
while(!t[nw].f1&&t[nw].v>i)↵
if(t[nw].mv[t[nw].v-1-i]=='D')↵
nw=t[nw].l;↵
else nw=t[nw].r;↵
cnt[nw]++;↵
}↵
res ans=dfs(root);↵
cout<<ans.w<<endl;↵
}↵
signed main(){↵
ios::sync_with_stdio(false);↵
cin.tie(0),cout.tie(0);↵
fac[0]=inv[0]=1;↵
for(int i=1;i<=5005;i++)↵
fac[i]=fac[i-1]*i%mod;↵
inv[5005]=ksm(fac[5005]);↵
for(int i=5004;i>=1;i--) inv[i]=inv[i+1]*(i+1)%mod;↵
int t;↵
cin>>t;↵
while(t--){solve();}↵
return 0;↵
}↵
```↵
↵
We sincerely ask the team to recheck his contest records, cancel the skipped status, and provide specific reasons and evidence for this judgment. Hope for a fair re-evaluation!
