oj.uz

답안 #967139

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
967139 2024-04-21T09:13:48 Z jamesbamber 늑대인간 (IOI18_werewolf) C++17
49 / 100
 922 ms 54584 KB 
#include "werewolf.h"
#include <bits/stdc++.h>
using namespace std;

struct segment{
    vector<int> mn, mx;

    void build(int v, int l, int r, vector<int> &vec){
        if(r-l == 1){
            mn[v] = vec[l], mx[v] = vec[l];
            return;
        }
        int m = (l+r)/2;
        build(2*v, l, m, vec);
        build(2*v+1, m, r, vec);
        mn[v] = min(mn[2*v], mn[2*v+1]);
        mx[v] = max(mx[2*v], mx[2*v+1]);
    }

    segment(int sz, vector<int> &vec){
        mn.resize(4*sz, INT_MAX), mx.resize(4*sz, -1);
        build(1, 0, sz, vec);
    }

    void upd(int v, int l, int r, int pos, int val){
        if(r-l == 1){
            mn[l] = val;
            mx[l] = val;
        }
        int m = (l+r)/2;
        
        if(pos < m) upd(2*v, l, m, pos, val);
        else upd(2*v+1, m, r, pos, val);

        mn[v] = min(mn[2*v], mn[2*v+1]);
        mx[v] = max(mx[2*v], mx[2*v+1]);
    }

    pair<int,int> query(int v, int l, int r, int ql, int qr){
        if(l >= qr or r <= ql) return {INT_MAX, -1};
        if(l >= ql and r <= qr) return {mn[v], mx[v]};
        int m = (l+r)/2;
        
        auto left = query(2*v, l, m, ql, qr);
        auto right = query(2*v+1, m, r, ql, qr);

        return {min(left.first, right.first), max(left.second, right.second)};
    }
};

std::vector<int> small(int N, std::vector<int> X, std::vector<int> Y, std::vector<int> S, std::vector<int> E, std::vector<int> L, std::vector<int> R){

    vector<vector<int>> ad(N);
    for(int i=0; i<X.size(); i++){
        ad[X[i]].push_back(Y[i]);
        ad[Y[i]].push_back(X[i]);
    }

    vector<int> vis(N);
    function<void(int, int, int)> dfs = [&](int v, int mn, int mx){
        vis[v] = 1;
        for(int u: ad[v]){
            if(vis[u] or u < mn or u > mx) continue;
            dfs(u, mn, mx);
        }
    };

    vector<int> ans(S.size());
    for(int i=0; i<S.size(); i++){
        vis.assign(N, 0);
        dfs(S[i], L[i], N);
        auto from_start = vis;

        vis.assign(N, 0);
        dfs(E[i], 0, R[i]);
        auto from_end = vis;

        for(int j=0; j<N; j++) if(from_start[j] and from_end[j]) ans[i] = 1;
    }
    return ans;
}

std::vector<int> check_validity(int N, std::vector<int> X, std::vector<int> Y, std::vector<int> S, std::vector<int> E, std::vector<int> L, std::vector<int> R){
    if(N<=3000 and X.size()<=6000 and S.size()<=3000) return small(N, X, Y, S, E, L, R); 
    
    vector<vector<int>> ad(N);
    for(int i=0; i<X.size(); i++){
        ad[X[i]].push_back(Y[i]);
        ad[Y[i]].push_back(X[i]);
    }
    if(X.size() != N-1) return {}; 

    vector<int> vis;
    function<void(int, int)> dfs = [&](int v, int p){
        vis.push_back(v);
        for(int u: ad[v]){
            if(u == p) continue;
            dfs(u, v);
        }
    };


    vector<int> v;
    dfs(0, -1);
    int e1 = vis.back();
    vis.clear();
    dfs(e1, -1);
    v = vis;

    vector<int> pos(N);
    for(int i=0; i<N; i++) pos[v[i]] = i;

    segment st(N, v);

    vector<int> ans(S.size());

    for(int i=0; i<S.size(); i++){
        if(pos[S[i]] < pos[E[i]]){
            int l = pos[S[i]], r = pos[E[i]]+1;
            while(r-l > 1){
                int m = (l+r)/2;
                auto [mn, mx] = st.query(1, 0, N, pos[S[i]], m+1);
                if(mn >= L[i]) l = m;
                else r = m;
            }

            if(st.query(1, 0, N, l, pos[E[i]]+1).second <= R[i]) ans[i] = 1;
        }
        else{
            int l = pos[E[i]], r = pos[S[i]]+1;
            while(r-l > 1){
                int m = (l+r)/2;
                auto [mn, mx] = st.query(1, 0, N, pos[E[i]], m+1);
                if(mx <= R[i]) l = m;
                else r = m;
            }

            if(st.query(1, 0, N, l, pos[S[i]]+1).first >= L[i]) ans[i] = 1;
        }
    }

    return ans;

}

Compilation message

werewolf.cpp: In function 'std::vector<int> small(int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
werewolf.cpp:54:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |     for(int i=0; i<X.size(); i++){
      |                  ~^~~~~~~~~
werewolf.cpp:69:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |     for(int i=0; i<S.size(); i++){
      |                  ~^~~~~~~~~
werewolf.cpp: In function 'std::vector<int> check_validity(int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
werewolf.cpp:87:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   87 |     for(int i=0; i<X.size(); i++){
      |                  ~^~~~~~~~~
werewolf.cpp:91:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   91 |     if(X.size() != N-1) return {};
      |        ~~~~~~~~~^~~~~~
werewolf.cpp:117:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  117 |     for(int i=0; i<S.size(); i++){
      |                  ~^~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 440 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 440 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 254 ms 1000 KB Output is correct
11 Correct 154 ms 860 KB Output is correct
12 Correct 23 ms 1112 KB Output is correct
13 Correct 287 ms 1020 KB Output is correct
14 Correct 174 ms 856 KB Output is correct
15 Correct 228 ms 1228 KB Output is correct

Subtask #3
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 779 ms 54276 KB Output is correct
2 Correct 837 ms 54472 KB Output is correct
3 Correct 913 ms 54472 KB Output is correct
4 Correct 821 ms 54468 KB Output is correct
5 Correct 846 ms 54424 KB Output is correct
6 Correct 808 ms 54424 KB Output is correct
7 Correct 922 ms 54420 KB Output is correct
8 Correct 856 ms 54584 KB Output is correct
9 Correct 385 ms 54404 KB Output is correct
10 Correct 490 ms 54216 KB Output is correct
11 Correct 562 ms 54404 KB Output is correct
12 Correct 554 ms 54472 KB Output is correct
13 Correct 877 ms 54476 KB Output is correct
14 Correct 821 ms 54472 KB Output is correct
15 Correct 842 ms 54424 KB Output is correct
16 Correct 839 ms 54472 KB Output is correct
17 Correct 829 ms 54420 KB Output is correct

Subtask #4
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 440 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 254 ms 1000 KB Output is correct
11 Correct 154 ms 860 KB Output is correct
12 Correct 23 ms 1112 KB Output is correct
13 Correct 287 ms 1020 KB Output is correct
14 Correct 174 ms 856 KB Output is correct
15 Correct 228 ms 1228 KB Output is correct
16 Correct 779 ms 54276 KB Output is correct
17 Correct 837 ms 54472 KB Output is correct
18 Correct 913 ms 54472 KB Output is correct
19 Correct 821 ms 54468 KB Output is correct
20 Correct 846 ms 54424 KB Output is correct
21 Correct 808 ms 54424 KB Output is correct
22 Correct 922 ms 54420 KB Output is correct
23 Correct 856 ms 54584 KB Output is correct
24 Correct 385 ms 54404 KB Output is correct
25 Correct 490 ms 54216 KB Output is correct
26 Correct 562 ms 54404 KB Output is correct
27 Correct 554 ms 54472 KB Output is correct
28 Correct 877 ms 54476 KB Output is correct
29 Correct 821 ms 54472 KB Output is correct
30 Correct 842 ms 54424 KB Output is correct
31 Correct 839 ms 54472 KB Output is correct
32 Correct 829 ms 54420 KB Output is correct
33 Incorrect 757 ms 39164 KB Output isn't correct
34 Halted 0 ms 0 KB -