제출 #909951

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
909951		IUA_Hasin	Stone Arranging 2 (JOI23_ho_t1)	C++17	35 / 100	38 ms	2908 KiB

Main

#include <bits/stdc++.h>
 
#define endl                                "\n"
#define finp                                for(int i=0; i<n; i++)
#define fknp                                for(int k=0; k<n; k++)
#define yeap                                cout<<"YES"<<endl
#define nope                                cout<<"NO"<<endl
#define inpintn                             int n; cin>>n
#define inpintarrn                          int arr[n]; for(int i=0; i<n; i++){cin>>arr[i];}
#define inpllarrn                           long long arr[n]; for(int i=0; i<n; i++){cin>>arr[i];}
#define ll                                  long long
 
using namespace std;
 
int main ()
{
        ll n;
        cin>>n;
        ll arr[n];
        ll cnt1 = -1;
        ll cnt2 = -1;
        for (int i=0; i<n; i++){
            cin>>arr[i];
            if(arr[i]==1){
                cnt1 = i;
            } else {
                cnt2 = i;
            }
        }

        ll a = arr[0];
 
        if(cnt1==-1){
            for(int i=0; i<n; i++){
                cout<<arr[i]<<endl;
            }
        } else if(cnt2==-1){
            for(int i=0; i<n; i++){
                cout<<arr[i]<<endl;
            }
        } else {
            if(a==1){
                for(int i=0; i<n; i++){
                    if(i<=cnt1){
                        cout<<1<<endl;
                    } else {
                        cout<<2<<endl;
                    }
                }
            } else {
                for(int i=0; i<n; i++){
                    if(i<=cnt2){
                        cout<<2<<endl;
                    } else {
                        cout<<1<<endl;
                    }
                }
            }
        }
     
    return 0;
  
}

• Subtask 1: 0 / 25
• Subtask 2: 35 / 35
• Subtask 3: 0 / 40