답안 #1050823

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1050823 2024-08-09T14:54:11 Z Andrey Monster Game (JOI21_monster) C++17
91 / 100
59 ms 596 KB
#include "monster.h"
#include<bits/stdc++.h>
using namespace std;

vector<int> haha(0);

void dude(int l, int r) {
    if(l == r) {
        return;
    }
    int mid = (l+r)/2;
    dude(l,mid);
    dude(mid+1,r);
    vector<int> wow(0);
    int x = l,y = mid+1;
    for(int i = 0; i < r-l+1; i++) {
        if(x != mid+1 && (y == r+1 || Query(haha[y],haha[x]))) {
            wow.push_back(haha[x]);
            x++;
        }
        else {
            wow.push_back(haha[y]);
            y++;
        }
    }
    for(int i = 0; i < wow.size(); i++) {
        haha[i+l] = wow[i];
    }
}

vector<int> Solve(int n) {
    for(int i = 0; i < n; i++) {
        haha.push_back(i);
    }
    dude(0,n-1);
    vector<bool> bruh(n);
    int big = 0;
    for(int i = 1; i < n; i++) {
        bruh[i] = Query(haha[0],haha[i]);
        if(bruh[i]) {
            big = i;
        }
    }
    int p = big-1;
    vector<int> ans(n);
    if(big == 2) {
        p = 1;
        for(int i = 3; i < n; i++) {
            if(Query(haha[1],haha[i])) {
                p = 0;
            }
        }
    }
    else {
        if(Query(haha[p],haha[0])) {
            p--;
            while(p > 0 && Query(haha[p],haha[big])) {
                p--;
            }
            if(p == 0 && Query(haha[0],haha[big-1])) {
                p--;
            }
        }
    }
    for(int i = p; i >= 0; i--) {
        ans[haha[i]] = p-i;
    }
    for(int i = p+1; i <= big; i++) {
        ans[haha[i]] = big-(i-p-1);
    }
    int y = p+1,x = big+1;
    for(int i = big+1; i < n; i++) {
        if(Query(haha[y],haha[i])) {
            for(int j = x; j <= i; j++) {
                ans[haha[j]] = i-(j-x);
            }
            y = x;
            x = i+1;
        }
    }
    return ans;
}

Compilation message

monster.cpp: In function 'void dude(int, int)':
monster.cpp:26:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |     for(int i = 0; i < wow.size(); i++) {
      |                    ~~^~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 8 ms 344 KB Output is correct
17 Correct 6 ms 344 KB Output is correct
18 Correct 7 ms 344 KB Output is correct
19 Correct 6 ms 344 KB Output is correct
20 Correct 10 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 6 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 4 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 8 ms 344 KB Output is correct
17 Correct 6 ms 344 KB Output is correct
18 Correct 7 ms 344 KB Output is correct
19 Correct 6 ms 344 KB Output is correct
20 Correct 10 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 6 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 4 ms 344 KB Output is correct
33 Correct 44 ms 344 KB Output is correct
34 Correct 46 ms 344 KB Output is correct
35 Correct 42 ms 596 KB Output is correct
36 Correct 49 ms 344 KB Output is correct
37 Correct 59 ms 344 KB Output is correct
38 Correct 34 ms 420 KB Output is correct
39 Correct 42 ms 344 KB Output is correct
40 Correct 39 ms 344 KB Output is correct
41 Correct 57 ms 344 KB Output is correct
42 Correct 37 ms 420 KB Output is correct
43 Correct 27 ms 436 KB Output is correct
44 Correct 24 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Partially correct 36 ms 420 KB Partially correct
2 Partially correct 44 ms 344 KB Partially correct
3 Partially correct 56 ms 344 KB Partially correct
4 Partially correct 59 ms 420 KB Partially correct
5 Partially correct 37 ms 592 KB Partially correct
6 Correct 35 ms 420 KB Output is correct
7 Correct 35 ms 592 KB Output is correct
8 Partially correct 40 ms 344 KB Partially correct
9 Partially correct 44 ms 344 KB Partially correct
10 Partially correct 52 ms 420 KB Partially correct
11 Partially correct 58 ms 420 KB Partially correct
12 Partially correct 42 ms 424 KB Partially correct
13 Correct 42 ms 592 KB Output is correct
14 Correct 45 ms 416 KB Output is correct
15 Correct 22 ms 344 KB Output is correct
16 Correct 18 ms 432 KB Output is correct
17 Correct 52 ms 592 KB Output is correct
18 Correct 31 ms 432 KB Output is correct