oj.uz

답안 #311823

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
311823 2020-10-11T20:18:36 Z MarcoMeijer Bubble Sort 2 (JOI18_bubblesort2) C++14
22 / 100
 3102 ms 2480 KB 
#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.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 79 ms 632 KB Output is correct
2 Correct 1205 ms 1272 KB Output is correct
3 Correct 3095 ms 2424 KB Output is correct
4 Correct 3097 ms 2296 KB Output is correct
5 Correct 3079 ms 2340 KB Output is correct
6 Correct 3081 ms 2340 KB Output is correct
7 Correct 3082 ms 2340 KB Output is correct
8 Correct 3079 ms 2424 KB Output is correct
9 Correct 3102 ms 2424 KB Output is correct
10 Correct 3085 ms 2424 KB Output is correct
11 Correct 3087 ms 2424 KB Output is correct
12 Correct 3082 ms 2424 KB Output is correct
13 Correct 3084 ms 2404 KB Output is correct
14 Correct 3090 ms 2304 KB Output is correct
15 Correct 3078 ms 2424 KB Output is correct
16 Correct 3096 ms 2296 KB Output is correct
17 Correct 3095 ms 2480 KB Output is correct
18 Correct 3089 ms 2304 KB Output is correct

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -