제출 #493404

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
493404		irmuun	Nice sequence (IZhO18_sequence)	C++17	15 / 100	12 ms	680 KiB

sequence

#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define ff first
#define ss second
#define PI 3.14159265359
ll n,m,t,p,h,b,c,d,e,f,i,j,k,r,l,mod=1000000007,mod1=998244353,MAX=1e18,ans;
pair<ll,ll>a[1000001];
string s,u;
ll df[101];
vector<pair<ll,ll> >v;
vector<ll>dv[101];
void dfs(ll x){
    df[x]=1;
    for(ll i=0;i<dv[x].size();i++){
        if(df[dv[x][i]]==0){
            dfs(dv[x][i]);
        }
    }
}
ll fastPow(ll a,ll b){
    ll d=1;
    while(b>0){
        if(b%2==1){
            d=d*a%mod;
        }
        b/=2;
        a=a*a%mod;
    }
    return d;
}
int main(){
    cin>>t;
    while(t--){
        cin>>n>>m;
        if(n==m){
            cout<<n-1<<endl;
            for(i=1;i<=n-1;i++){
                cout<<i<<' ';
            }
            cout<<endl;
            continue;
        }
        if(n%m==0||m%n==0){
            cout<<max(n,m)-1<<endl;
            if(n>m){
                for(i=1;i<max(n,m);i++){
                    cout<<1<<' ';
                }
                cout<<endl;
            }
            else{
                for(i=1;i<max(n,m);i++){
                    cout<<-1<<' ';
                }
                cout<<endl;
            }
            continue;
        }
        if(min(n,m)==2){
            cout<<max(n,m)<<endl;
            if(n>m){
                for(i=1;i<=n/2;i++){
                    cout<<-100000<<' '<<100001<<' ';
                }
                cout<<-100000<<endl;
            }
            else{
                for(i=1;i<=m/2;i++){
                    cout<<100000<<' '<<-100001<<' ';
                }
                cout<<100000<<endl;
            }
        }
    }
}

컴파일 시 표준 에러 (stderr) 메시지

sequence.cpp: In function 'void dfs(long long int)':
sequence.cpp:16:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |     for(ll i=0;i<dv[x].size();i++){
      |                ~^~~~~~~~~~~~~

• 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