oj.uz

답안 #13962

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
13962 2015-04-24T16:14:22 Z gs14004 버블 정렬 (OJUZ10_bubblesort) C++14
0 / 100
 69 ms 4020 KB 
#include <cstdio>
#include <queue>
#include <set>
using namespace std;
typedef pair<int,int> pi;

int n,k,a[100005],ret[100005];
bool vis[100005];
int sorted_pos[100005];
priority_queue<pi> pq;

int main(){
    scanf("%d %d",&n,&k);
    for (int i=0; i<n; i++) {
        scanf("%d",&a[i]);
        pq.push(pi(a[i],i));
    }
    int pt = n;
    while (!pq.empty()) {
        pi t = pq.top();
        pq.pop();
        sorted_pos[t.second] = --pt;
        if(pt >= n-k) vis[t.second] = 1,ret[pt] = t.first;
    }
    for (int i=0; i<n; i++) {
        if(!vis[i] && i - sorted_pos[i] >= k){
            ret[i - k] = a[i];
            vis[i] = 1;
        }
    }
    int p = 0;
    for (int i=0; i<n; i++) {
        while (ret[p]) {
            p++;
        }
        if(!vis[i]) ret[p++] = a[i];
    }
    for (int i=0; i<n; i++) {
        printf("%d ",ret[i]);
    }
}

Subtask #1
0.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 2480 KB Output isn't correct
2 Correct 0 ms 2480 KB Output is correct
3 Incorrect 0 ms 2480 KB Output isn't correct
4 Incorrect 0 ms 2480 KB Output isn't correct
5 Incorrect 0 ms 2480 KB Output isn't correct
6 Incorrect 0 ms 2480 KB Output isn't correct
7 Incorrect 0 ms 2480 KB Output isn't correct

Subtask #2
0.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 2480 KB Output isn't correct
2 Incorrect 0 ms 2480 KB Output isn't correct
3 Incorrect 0 ms 2480 KB Output isn't correct
4 Incorrect 0 ms 2480 KB Output isn't correct
5 Incorrect 0 ms 2480 KB Output isn't correct
6 Incorrect 0 ms 2480 KB Output isn't correct
7 Incorrect 0 ms 2480 KB Output isn't correct
8 Incorrect 0 ms 2480 KB Output isn't correct
9 Correct 0 ms 2480 KB Output is correct
10 Incorrect 0 ms 2480 KB Output isn't correct

Subtask #3
0.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 60 ms 4020 KB Output is correct
2 Incorrect 41 ms 4020 KB Output isn't correct
3 Incorrect 47 ms 4020 KB Output isn't correct
4 Incorrect 38 ms 4020 KB Output isn't correct
5 Incorrect 29 ms 4020 KB Output isn't correct
6 Incorrect 48 ms 4020 KB Output isn't correct
7 Incorrect 18 ms 3252 KB Output isn't correct
8 Incorrect 50 ms 4020 KB Output isn't correct
9 Incorrect 68 ms 4020 KB Output isn't correct
10 Incorrect 47 ms 4020 KB Output isn't correct
11 Incorrect 47 ms 4020 KB Output isn't correct
12 Incorrect 32 ms 4020 KB Output isn't correct
13 Incorrect 46 ms 4020 KB Output isn't correct
14 Incorrect 69 ms 4020 KB Output isn't correct
15 Incorrect 51 ms 4020 KB Output isn't correct

Subtask #4
0.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 52 ms 4020 KB Output isn't correct
2 Incorrect 48 ms 4020 KB Output isn't correct
3 Incorrect 47 ms 4020 KB Output isn't correct
4 Incorrect 51 ms 4020 KB Output isn't correct
5 Incorrect 52 ms 4020 KB Output isn't correct
6 Incorrect 49 ms 4020 KB Output isn't correct
7 Incorrect 45 ms 4020 KB Output isn't correct
8 Incorrect 51 ms 4020 KB Output isn't correct
9 Incorrect 37 ms 4020 KB Output isn't correct
10 Incorrect 33 ms 4020 KB Output isn't correct
11 Incorrect 48 ms 4020 KB Output isn't correct
12 Incorrect 54 ms 4020 KB Output isn't correct
13 Correct 42 ms 4020 KB Output is correct
14 Incorrect 15 ms 3252 KB Output isn't correct
15 Incorrect 56 ms 4020 KB Output isn't correct