• 哪吒电影收藏卡包一包,200硬币。

8 条评论

  • @ 2025-7-20 16:33:20

    发错了

    • @ 2025-7-20 16:32:02
      #include <bits/stdc++.h>
      using namespace std;
      struct candy{
          long long f,g;
      }; 
      long long n,m,t[200005];
      candy a[200005];
      bool cmp(candy a,candy b)
      {
          return a.f<b.f;
      }
      int main()
      {
          freopen("candy2.in","r",stdin);
          freopen("candy2.out","w",stdout);
          cin>>n>>m;
          for(int i=1;i<=n;i++)
          {
              cin>>a[i].f;
              a[i].g=i;
          }
          long long y=m/n;
          long long x=m%n;
          for(int i=1;i<=n;i++)
          {
              t[i]+=y;
          }
          sort(a+1,a+n+1,cmp);
          for(int i=1;i<=x;i++)
          {
              t[a[i].g]++;
          }
          for(int i=1;i<=n;i++) cout<<t[i]<<endl;
          return 0;
      }
      
      • @ 2025-7-20 16:33:26
        #include <bits/stdc++.h>
        using namespace std;
        int n,a[200005],b[200005],cnt1,cnt2,cnt3,x,y,ans,l[200005],u[200005],v[200005];
        int main() {
            //freopen("candy1.in","r",stdin);
            //freopen("candy1.out","w",stdout);
            cin>>n;
            for(int i=1;i<=n;i++){
            	cin>>a[i];
            	b[i]=a[i]%3;
        	}
        	for(int i=1;i<=n;i++){
        		if(b[i]==0){
        			cnt1++;
        			l[cnt1]=i;
        		}
        		if(b[i]==1){
        			cnt2++;
        			u[cnt2]=i;
        		}
        		if(b[i]==2){
        			cnt3++;
        			v[cnt3]=i;
        		}
        	}
        	if(cnt3<=cnt2&&cnt3<=cnt1){
        		ans=cnt3;
        		x=(cnt2-cnt3)/3;
        		y=(cnt1-cnt3)/3;
        		ans+=x+y;
        		cout<<ans<<endl;
        		for(int i=1;i<=cnt3;i++){
        			cout<<l[i]<<' '<<u[i]<<' '<<v[i]<<endl;
        		}
        		if(x>0){
        			for(int i=cnt3+1;i+2<=cnt2;i+=3){
        				cout<<u[i]<<' '<<u[i+1]<<' '<<u[i+2]<<endl;
        			}
        		}
        		if(y>0){
        			for(int i=cnt3+1;i+2<=cnt1;i+=3){
        				cout<<l[i]<<' '<<l[i+1]<<' '<<l[i+2]<<endl;
        			}
        		}
        	}else if(cnt2<=cnt3&&cnt2<=cnt1){
        		ans=cnt2;
        		x=(cnt3-cnt2)/3;
        		y=(cnt1-cnt2)/3;
        		ans+=x+y;
        		cout<<ans<<endl;
        		for(int i=1;i<=cnt2;i++){
        			cout<<l[i]<<' '<<u[i]<<' '<<v[i]<<endl;
        		}
        		if(x>0){
        			for(int i=cnt2+1;i+2<=cnt3;i+=3){
        				cout<<v[i]<<' '<<v[i+1]<<' '<<v[i+2]<<endl;
        			}
        		}
        		if(y>0){
        			for(int i=cnt2+1;i+2<=cnt1;i+=3){
        				cout<<l[i]<<' '<<l[i+1]<<' '<<l[i+2]<<endl;
        			}
        		}
        	}else if(cnt1<=cnt2&&cnt1<=cnt3){
        		ans=cnt1;
        		x=(cnt2-cnt1)/3;
        		y=(cnt3-cnt1)/3;
        		ans+=x+y;
        		cout<<ans<<endl;
        		for(int i=1;i<=cnt1;i++){
        			cout<<l[i]<<' '<<u[i]<<' '<<v[i]<<endl;
        		}
        		if(x>0){
        			for(int i=cnt1+1;i+2<=cnt2;i+=3){
        				cout<<u[i]<<' '<<u[i+1]<<' '<<u[i+2]<<endl;
        			}
        		}
        		if(y>0){
        			for(int i=cnt1+1;i+2<=cnt3;i+=3){
        				cout<<v[i]<<' '<<v[i+1]<<' '<<v[i+2]<<endl;
        			}
        		}
        	}
            return 0;
        }
        
        
        
    • @ 2025-7-20 9:57:57

      • @ 2025-7-19 10:12:56

        • @ 2025-7-18 14:48:02

          懒人有懒福

          • @ 2025-7-18 10:51:35

            第3啊好吧(西安)

          • @ 2025-7-17 9:21:20

            前排售卖烤面包,qp

            • @ 2025-7-16 14:08:41

              qp第一! (虽然我是西安的)

              • 1