oj.uz

답안 #591096

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
591096 2022-07-06T21:16:00 Z PiejanVDC 늑대인간 (IOI18_werewolf) C++17
34 / 100
 685 ms 131848 KB 
#include "werewolf.h"
#include <bits/stdc++.h>
using namespace std;

vector<int>check_validity(int n, vector<int>x, vector<int>y, vector<int>s, vector<int>e, vector<int>l, vector<int>r) {
    const int m = (int)x.size();
    const int q = (int)s.size();

    vector<int>ans(q, 0);

    int start;

    vector<int>adj[n];

    for(int i = 0 ; i < m ; i++) {
        adj[x[i]].push_back(y[i]);
        adj[y[i]].push_back(x[i]);
    }

    for(int i = 0 ; i < n ; i++) {
        if(adj[i].size() == 1)
            start = i;
    }

    vector<int>v(n+1);
    vector<bool>vis(n, 0);

    vector<int>rev(n);

    for(int i = 0 ; i < n ; i++) {
        v[i] = start;
        vis[start] = 1;
        rev[start] = i;
        
        for(auto z : adj[start]) if(!vis[z]) start = z;
    }

    v[n] = n+5;

    int mx[n+1][32];
    int mn[n+1][32];

    int lmx[n+1][32];
    int lmn[n+1][32];

    for(int i = 0 ; i < n ; i++) {
        mn[i][0] = min(v[i], v[i+1]);
        mx[i][0] = max(v[i], v[max(0,i-1)]);
    }

    for(int j = 1 ; j <= 30 ; j++) {
        for(int i = 0 ; i <= n ; i++) {
            mx[i][j] = max(mx[i][j-1], mx[ max(0, i - (1 << (j-1))) ][j-1]);
            mn[i][j] = min(mn[i][j-1], mn[ min(n, i + (1 << (j-1))) ][j-1]);
        }
    }

    for(int i = 0 ; i < n ; i++) {
        lmx[i][0] = max(v[i], v[i+1]);
        lmn[i][0] = min(v[i], v[max(0,i-1)]);
    }

    for(int j = 1 ; j <= 30 ; j++) {
        for(int i = 0 ; i <= n ; i++) {
            lmx[i][j] = max(lmx[i][j-1], lmx[ min(n, i + (1 << (j-1))) ][j-1]);
            lmn[i][j] = min(lmn[i][j-1], lmn[ max(0, i - (1 << (j-1))) ][j-1]);
        }
    }

    for(int i = 0 ; i < q ; i++) {
        if(s[i] < l[i] || e[i] > r[i])
            continue;
        if(rev[s[i]] <= rev[e[i]]) {
            int x = rev[s[i]];
            
            for(int j = 30 ; j >= 0 ; j--) {
                if(mn[x][j] >= l[i])
                    x = min(n, x + (1 << j));
            }
            
            int y = rev[e[i]];
            
            for(int j = 30 ; j >= 0 ; j--) {
                if(mx[y][j] <= r[i])
                    y = max(0, y - (1 << j));
            }
            
            if(x >= y)
                ans[i] = 1; 
       
        } else {
            int x = rev[s[i]];
            
            for(int j = 30 ; j >= 0 ; j--) {
                if(lmn[x][j] >= l[i])
                    x = max(0, x - (1 << j));
            }
            
            int y = rev[e[i]];
            
            for(int j = 30 ; j >= 0 ; j--) {
                if(lmx[y][j] <= r[i])
                    y = min(n, y + (1 << j));
            }
            
            if(y >= x)
                ans[i] = 1; 
        }
    }
    return ans;
}

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 618 ms 123156 KB Output is correct
2 Correct 671 ms 131700 KB Output is correct
3 Correct 647 ms 131712 KB Output is correct
4 Correct 656 ms 131672 KB Output is correct
5 Correct 666 ms 131612 KB Output is correct
6 Correct 590 ms 131588 KB Output is correct
7 Correct 658 ms 131588 KB Output is correct
8 Correct 612 ms 131672 KB Output is correct
9 Correct 579 ms 131752 KB Output is correct
10 Correct 539 ms 131688 KB Output is correct
11 Correct 555 ms 131724 KB Output is correct
12 Correct 493 ms 131584 KB Output is correct
13 Correct 685 ms 131676 KB Output is correct
14 Correct 650 ms 131676 KB Output is correct
15 Correct 681 ms 131848 KB Output is correct
16 Correct 670 ms 131672 KB Output is correct
17 Correct 596 ms 131660 KB Output is correct

Subtask #4
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -