제출 #172728

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
172728		mosiashvililuka	Nice sequence (IZhO18_sequence)	C++14	15 / 100	10 ms	888 KiB

sequence

#include<bits/stdc++.h>
using namespace std;
long long a,b,c,d,e,tes,t,n,m,zx,cnst=50000,p[1000009],pi,jm[1000009];
int main(){
    ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    cin>>tes;
    for(t=1; t<=tes; t++){
        cin>>n>>m;
        if(n<m){
            swap(n,m);
            zx=-1;
        }else{
            zx=1;
        }
        if(n%m==0||m==2){
        if(n%m==0){
        cout<<n-1<<endl;
        if(n!=1){
            for(b=1; b<n; b++){
                cout<<zx<<" ";
            }
            cout<<endl;
        }
        }else{
            cout<<n<<endl;
            for(b=1; b<=n; b++){
                if(b%2==0) cout<<zx*1000000<<" "; else cout<<-zx*999999<<" ";
            }
            cout<<endl;
        }
        continue;
        }
        while(1){
            pi++;
            if(pi%m==0){
                p[pi]=zx*cnst*(m-1)-zx;
            }else{
                p[pi]=-zx*cnst;
            }
            jm[pi]=jm[pi-1]+p[pi];
            if(pi>=n){
                if(jm[pi]-jm[pi-n]==-abs(jm[pi]-jm[pi-n])*zx){
                    
                }else{
                    pi--;
                    break;
                }
            }
        }
        cout<<pi<<endl;
        for(c=1; c<=pi; c++) cout<<p[c]<<" ";
        cout<<endl;
    }
    return 0;
}

• Subtask 1: 6 / 6
• Subtask 2: 9 / 9
• Subtask 3: 0 / 14
• Subtask 4: 0 / 15
• Subtask 5: 0 / 14
• Subtask 6: 0 / 18
• Subtask 7: 0 / 24