제출 #1328986

#제출 시각아이디문제언어결과실행 시간메모리
1328986lywoemStone Arranging 2 (JOI23_ho_t1)C++20
0 / 100
1 ms344 KiB
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define l(a, b, i) for (ll i = a; i < b; i++)
#define rl(a, b, i) for (ll i = a; i >= b; i--)
#define vpair vector<pair<ll, ll>>
#define inf LLONG_MAX
#define ninf LLONG_MIN

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    ll N; cin >> N; vector<ll> vec(N + 1, 0);
    l(1, N + 1, i) cin >> vec[i];

// Crab 2
    if (vec[1] == 1) {
        ll idx1 = 1;
        l(2, N + 1, i) if (vec[i] == 1) idx1 = 1;
        l(1, idx1 + 1, i) cout << 1 << "\n";
        l(idx1 + 1, N + 1, i) cout << 2 << "\n";
    }

    else if (vec[1] == 2) {
        ll idx2 = 1;
        l(2, N + 1, i) if (vec[i] == 2) idx2 = 1;
        l(1, idx2 + 1, i) cout << 2 << "\n";
        l(idx2 + 1, N + 1, i) cout << 1 << "\n";
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...