2023年USACO 3月公開賽銅組真題及解析！附USACO競賽輔導(dǎo)

#include <iostream>
using namespace std;#define rep(i,h,t) for (int i=h;i<=t;i++)#define dep(i,t,h) for (int i=t;i>=h;i--)int n;char s[200010];bool t[200010];int main(){    scanf("%d",&n);    scanf("%s",s+1);    int O=0;    rep(i,1,n)      if (s[i]==s[i-1]&&s[i]!='F') O++;        int Q1=0,Q2=0;    rep(i,1,n)    {        if (s[i]=='F')        {            int j=i;            while (s[j]=='F'&&j<=n) j++;                    j--;            int num=j-i+1;            if (i!=1&&j!=n)            {                if (s[i-1]==s[j+1]) num++;                O+=num%2;                Q1+=num/2;            } else Q2+=num;            i=j;        }    }        rep(i,0,Q1)      rep(j,0,Q2)        t[i*2+j+O]=1;    int OO=0;    rep(i,0,n-1)      if (t[i]) OO++;    cout<<OO<<endl;    rep(i,0,n-1)      if (t[i]) cout<<i<<endl;    return 0;}

#include <iostream>#include <vector>#define rep(i,h,t) for (int i=h;i<=t;i++)#define dep(i,t,h) for (int i=t;i>=h;i--)using namespace std;struct nd{    int a,b,c,d;    bool operator <(const nd x)const{        return d>x.d;    }};int main(){    int T;    cin>>T;    while (T--)    {        int n,c,p;        cin>>n>>c>>p;        string A,B;        vector<string> Q1,Q2,Q3,Q4; //¥Ê¥¢4÷÷µ•¥        rep(i,1,n)        {            cin>>A>>B;            if (B=="noun") Q1.push_back(A);            if (B=="intransitive-verb") Q2.push_back(A);            if (B=="transitive-verb") Q3.push_back(A);            if (B=="conjunction") Q4.push_back(A);        }        int maxand=min((int)(Q4.size()),p);        int maxword=maxand+p;        vector<nd> ans;        rep(s1,0,Q3.size()) //√∂柠?¡ø        {            int s2=min((int)(Q2.size()),maxword-s1);            s2=min(s2,(int)(Q1.size())-2*s1);            int s3=min(c,(int)(Q1.size())-2*s1-s2);            if (!s1) while (s3>0) s3--;            if (s1<0||s2<0||s3<0) continue;            ans.push_back({s1,s2,s3,3*s1+2*s2+s3});        }        sort(ans.begin(),ans.end());        int s1=0,s2=0,s3=0,O=0; //µ√≥ˆ◊Ó”≈µƒ«Èøˆ        if (ans.size())        {            s1=ans[0].a,s2=ans[0].b,s3=ans[0].c,O=ans[0].d;        }        vector<string> Q; //¥¶¿Ì≥ˆ∂‘”¶µƒæ‰◊”        rep(i,1,s2)        {            Q.push_back(Q1.back()+" "+Q2.back());            Q1.pop_back(); Q2.pop_back();        }        rep(i,1,s1)        {            string s=Q1.back()+" "+Q3.back();            Q1.pop_back(); Q3.pop_back();            s+=" "+Q1.back();            Q1.pop_back();            if (i==1)            {                while (s3--)                {                    s+=", "+Q1.back();                    Q1.pop_back();                }            }            Q.push_back(s);        }        int round=min((int)(Q4.size()),(int)(Q.size())/2);        cout<<O+round<<endl;        string W; //Ω´æ‰◊”¡¨Ω”∫Û ‰≥ˆ        rep(i,0,round-1)        {          W+=Q[i*2]+" "+Q4.back()+" "+Q[i*2+1]+". ";          Q4.pop_back();        }        for (int i=round*2;i<Q.size();i++)          W+=Q[i]+". ";        for (int i=0;i+1<W.length();i++)          cout<<W[i];        cout<<endl;    }    return 0;}

#include <iostream>#include <vector>using namespace std;#define rep(i,h,t) for (int i=h;i<=t;i++)#define dep(i,t,h) for (int i=t;i>=h;i--)int n,k,t;int main(){    cin>>n>>k>>t;    vector<int> a(n+10),L(n+10),R(n+10),p(n+10);    vector<bool> h(n+10);    rep(i,1,k) cin>>a[i];    a[k+1]=a[1]+n;    rep(i,1,k) h[a[i]]=1;    rep(i,0,n-1)      if (h[i]) L[i]=i; else L[i]=L[i-1];      rep(i,1,k) R[a[i]]=a[i+1]-a[i];    rep(i,0,n-1)    {        int tim=t-i+L[i];        int round=tim/R[L[i]];        if (tim%R[L[i]]!=0) round++;           p[(i+round*R[L[i]])%n]=i;           }    rep(i,0,n-2) cout<<p[i]<<" ";    cout<<p[n-1];    return 0;}