제출 #774685

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
774685		vjudge1	Stone Arranging 2 (JOI23_ho_t1)	C++17	25 / 100	2072 ms	1876 KiB

Main

// #pragma GCC optimize("Ofast,unroll-loops")

#ifdef MINHDEPTRAI
 
#include "/Library/Developer/CommandLineTools/usr/include/c++/v1/bits/stdc++.h"
#include <chrono>
#define __gcd(a, b) gcd(a, b)
using namespace std ::chrono;
#else
#include <bits/stdc++.h>
#endif
using namespace std;
#define foru(i, a, b) for (int i = a; i <= b; ++i)
#define ford(i, a, b) for (int i = a; i >= b; --i)
#define IOS ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mp(a, b) make_pair(a, b)
// #define int long long
typedef pair<int, int>  pii;
typedef pair<pair<int, int>, int> piii;
#define endl '\n'
const string name_minh = "9";
#define int long long
const int maxN = 2e5 + 5;
const int mod = 1;

const int inf = 1e9;
int n, arr[maxN];
void solve(){
    cin >> n;
    foru(i, 1, n) cin >> arr[i];

    int i = 1, j = n;
    while(i <= n){
        while(arr[i] != arr[j] && j >= i){
            j--;
        }

        if(j == i - 1){
            i++;
            j = n; 
        }
        else{
            foru(k, i, j){
                arr[k] = arr[i];
            }
            i++;
            j = n;
        }
    }

    foru(i, 1, n) cout << arr[i] << " ";
    return;
}
signed main(){
    IOS
    // #ifdef MINHDEPTRAI 
    // ifstream cin(name_minh + ".in");
    // ofstream cout(name_minh + ".out");
    // #endif
    solve();


}

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