제출 #311823

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
311823		MarcoMeijer	Bubble Sort 2 (JOI18_bubblesort2)	C++14	22 / 100	3102 ms	2480 KiB

bubblesort2

#include "bubblesort2.h"
#include <bits/stdc++.h>
using namespace std;

// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e9
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

const int MX = 101;

int cnt[MX];

vi countScans(vi A, vi X, vi V){
    int n=A.size();
	int q=X.size();
	vi ans(q);

    RE(i,n)
        REP(j,A[i],MX)
            cnt[j]++;

    RE(j,q) {
        REP(i,A[X[j]],MX)
            cnt[i]--;
        A[X[j]] = V[j];
        REP(i,A[X[j]],MX)
            cnt[i]++;

        int cAns = 0;
        RE(i,n)
            cAns = max(cAns, i-int(cnt[A[i]] - 1));
        ans[j] = cAns;
    }

	return ans;
}

• Subtask 1: 0 / 17
• Subtask 2: 0 / 21
• Subtask 3: 22 / 22
• Subtask 4: 0 / 40