oj.uz

답안 #1050946

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1050946 2024-08-09T17:09:45 Z Andrey Monster Game (JOI21_monster) C++17
100 / 100
 59 ms 592 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<int> ans(n);
    bool yeah = true;
    vector<bool> bruh(n);
    int big;
    for(int i = 2; i < n; i++) {
        if(Query(haha[0],haha[i])) {
            bruh[i] = true;
            if(!yeah) {
                big = i;
                break;
            }
        }
        else {
            if(yeah && ((i == 3) || (i >= 3 && Query(haha[i-1],haha[1])))) {
                big = i-1;
                yeah = false;
                break;
            }
            yeah = false;
        }
    }
    if(yeah) {
        if(Query(haha[n-1],haha[1])) {
            for(int i = 0; i < n-1; i++) {
                ans[haha[i]] = n-2-i;
            }
            ans[haha[n-1]] = n-1;
        }
        else {
            for(int i = 0; i < n; i++) {
                ans[haha[i]] = n-1-i;
            }
        }
        return ans;
    }
 /*   for(int i = 0; i < n; i++) {
        cout << haha[i] << " ";
    }
    cout << endl;*/
    int p = big-1;
    bool no = true;
    if(big == 2) {
        no = false;
        if(Query(haha[0],haha[3])) {
            ans[haha[0]] = 2;
            ans[haha[1]] = 1;
            ans[haha[2]] = 0;
            ans[haha[3]] = 3;
            p = 2;
            big = 3;
        }
        else if(Query(haha[1],haha[3])) {
            ans[haha[0]] = 0;
            ans[haha[1]] = 2;
            ans[haha[2]] = 1;
            ans[haha[3]] = 3;
            p = 2;
            big = 3;
        }
        else if(Query(haha[2],haha[3])) {
            ans[haha[0]] = 1;
            ans[haha[1]] = 0;
            ans[haha[2]] = 2;
            ans[haha[3]] = 3;
            p = 2;
            big = 3;
        }
        else {
            int q;
            for(int i = 5; i <= n; i++) {
                if(i == n || (!Query(haha[3],haha[i]))) {
                    if(Query(haha[0],haha[i-1]) || Query(haha[1],haha[i-1]) || Query(haha[2],haha[i-1])) {
                        q = i-1;
                    }
                    else {
                        q = i-2;
                    }
                    break;
                }
            }
            if(Query(haha[0],haha[q])) {
                ans[haha[0]] = 2;
                ans[haha[1]] = 1;
                ans[haha[2]] = 0;
            }
            else if(Query(haha[1],haha[q])) {
                ans[haha[0]] = 0;
                ans[haha[1]] = 2;
                ans[haha[2]] = 1;
            }
            else if(Query(haha[2],haha[q])) {
                ans[haha[0]] = 1;
                ans[haha[1]] = 0;
                ans[haha[2]] = 2;
            }
            for(int i = 3; i <= q; i++) {
                ans[haha[i]] = q-(i-3);
            }
            big = q;
            p = 2;
        }
    }
    else {
        while(p > 1 && !bruh[p]) {
            p--;
        }
        if(p == 1 && Query(haha[1],haha[big])) {
            p--;
        }
    }
   /* for(int i = 0; i < n; i++) {
        cout << ans[i] << " ";
    }
    cout << endl;*/
    if(no) {
        for(int i = 0; i <= p; 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++) {
      |                    ~~^~~~~~~~~~~~
monster.cpp: In function 'std::vector<int> Solve(int)':
monster.cpp:75:9: warning: 'big' may be used uninitialized in this function [-Wmaybe-uninitialized]
   75 |     int p = big-1;
      |         ^
monster.cpp:116:36: warning: 'q' may be used uninitialized in this function [-Wmaybe-uninitialized]
  116 |             if(Query(haha[0],haha[q])) {
      |                                    ^

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 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 0 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 0 ms 388 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 5 ms 344 KB Output is correct
17 Correct 6 ms 344 KB Output is correct
18 Correct 6 ms 344 KB Output is correct
19 Correct 5 ms 344 KB Output is correct
20 Correct 6 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 3 ms 344 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 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 5 ms 344 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 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 0 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 0 ms 388 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 5 ms 344 KB Output is correct
17 Correct 6 ms 344 KB Output is correct
18 Correct 6 ms 344 KB Output is correct
19 Correct 5 ms 344 KB Output is correct
20 Correct 6 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 3 ms 344 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 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 5 ms 344 KB Output is correct
33 Correct 37 ms 420 KB Output is correct
34 Correct 33 ms 424 KB Output is correct
35 Correct 35 ms 416 KB Output is correct
36 Correct 55 ms 420 KB Output is correct
37 Correct 39 ms 424 KB Output is correct
38 Correct 35 ms 420 KB Output is correct
39 Correct 39 ms 420 KB Output is correct
40 Correct 25 ms 344 KB Output is correct
41 Correct 41 ms 592 KB Output is correct
42 Correct 37 ms 416 KB Output is correct
43 Correct 24 ms 592 KB Output is correct
44 Correct 24 ms 344 KB Output is correct

Subtask #3
75.0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 436 KB Output is correct
2 Correct 30 ms 344 KB Output is correct
3 Correct 41 ms 416 KB Output is correct
4 Correct 48 ms 416 KB Output is correct
5 Correct 37 ms 436 KB Output is correct
6 Correct 21 ms 344 KB Output is correct
7 Correct 32 ms 420 KB Output is correct
8 Correct 59 ms 416 KB Output is correct
9 Correct 42 ms 420 KB Output is correct
10 Correct 32 ms 420 KB Output is correct
11 Correct 50 ms 344 KB Output is correct
12 Correct 45 ms 592 KB Output is correct
13 Correct 29 ms 420 KB Output is correct
14 Correct 30 ms 592 KB Output is correct
15 Correct 17 ms 344 KB Output is correct
16 Correct 20 ms 344 KB Output is correct
17 Correct 54 ms 420 KB Output is correct
18 Correct 34 ms 416 KB Output is correct