oj.uz

답안 #605418

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
605418 2022-07-25T17:21:15 Z AmirElarbi 늑대인간 (IOI18_werewolf) C++14
34 / 100
 949 ms 524288 KB 
#include <bits/stdc++.h>
#define vi vector<int>
#define gi greater<int>
#define gr greater
#define ve vector
#define ll long long
#define vf vector<float>
#define vll vector<pair<ll,ll>>
#define ii pair<int,int>
#define pll pair<ll,ll>
#define vvi vector<vi>
#define vii vector<ii>
#define gii greater<ii>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF 1e9
#define eps 1e-7
#define eps1 1e-2
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MAX_A 2e5+5
using namespace std;
const int MOD = 1e9+7;
const int nax = 2e5+5;
typedef complex<int> Point;
//#define X real()
//#define Y imag()
#include "werewolf.h"
vi fin, adj[nax];
ii st[nax*4];
int ind[nax];
void dfs(int u, int p){
    fin.pb(u);
    for(auto x : adj[u]){
        if(x == p) continue;
        dfs(x,u);
    }
}
void build(int v,int l, int r){
    if(l ==r) {
        st[v].fi = st[v].se = fin[l];
        return;
    }
    int md = (l+r)/2;
    build(v*2, l, md);
    build(v*2+1, md+1, r);
    st[v].fi = max(st[v*2].fi, st[v*2+1].fi);
    st[v].se = min(st[v*2].se, st[v*2+1].se);
}
int query(int v, int l, int r, int i, int j, int ind){
    if(i > j) swap(i,j);
    if(r < i ||l > j) {
        if(ind) return INF;
        else return 0;
    }
    if(i <= l && r <= j){
        if(ind) return st[v].se;
        else return st[v].fi;
    }
    int md = (l+r)/2;
    if(!ind) return max(query(v*2,l,md,i,j,ind), query(v*2+1, md+1, r, i, j, ind));
    else return min(query(v*2,l,md,i,j,ind), query(v*2+1, md+1, r, i, j, ind));
}
bool vis[nax][2];
bool dfs2(int u, int end, int l, int r, bool ind){
    vis[u][ind] = 1;
    if(u == end) return ind;
    bool p = false;
    for(auto x : adj[u]){
        if(vis[x]) continue;
        if(ind == 1 && u <= r) p |= dfs2(x,end,l,r,ind);
        if(ind == 0 && u <= r && l <= u) p |= dfs2(x,end,l,r,1);
        if(ind == 0 && l <= u) p |= dfs2(x,end,l,r,0);
        if(p) break;
    }
    return p;
}
vi check_validity(int n, vi x, vi y, vi s, vi e, vi low,vi high) {

    int m = x.size();
    for (int i = 0; i < m; ++i)
    {
        adj[x[i]].pb(y[i]);
        adj[y[i]].pb(x[i]);
    }
    int q = s.size();
    vi a(q);
    if(n <=3000 && m<=6000 && q<=3000){
        for (int i = 0; i < q; ++i)
        {
            memset(vis,0,sizeof vis);
            if(dfs2(s[i], e[i], low[i], high[i],0)) a[i] = 1;
            else a[i] = 0;
        }
    }
    for (int i = 0; i < n; ++i)
    {
        if(adj[i].size() == 1){
            dfs(i,i);
            break;
        }
    }
    build(1,0,n-1);
    for (int i = 0; i < n; ++i)
    {
        ind[fin[i]] = i;
    }
    
    for (int i = 0; i < q; ++i) {
        int l = min(ind[e[i]],ind[s[i]]), r = max(ind[e[i]],ind[s[i]])+1;
        while(l < r){
            int md = (l+r)/2;
            int mn = query(1,0,n-1, ind[s[i]], md, 1), mx = query(1,0,n-1, md, ind[e[i]], 0);
            //cout << mn << " " << mx << " " << md << endl;
            if(mn < low[i] && mx > high[i]){
                a[i] = 0;
                break;
            } else if(mn < low[i]){
                if(ind[s[i]] < ind[e[i]]) r = md;
                else l = md+1;
            } else if(mx > high[i]) {
                if(ind[s[i]] < ind[e[i]]) l = md+1;
                else r = md;
            } else{
                if(mx >= low[i] || mn <= high[i]) a[i] = 1;
                else a[i] = 0;
                break;
            }
        }
    }
    return a;
}

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 320 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 320 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 413 ms 36672 KB Output is correct
2 Correct 428 ms 36704 KB Output is correct
3 Correct 446 ms 36796 KB Output is correct
4 Correct 840 ms 36792 KB Output is correct
5 Correct 949 ms 36800 KB Output is correct
6 Correct 924 ms 36800 KB Output is correct
7 Correct 615 ms 36764 KB Output is correct
8 Correct 423 ms 36832 KB Output is correct
9 Correct 441 ms 36740 KB Output is correct
10 Correct 519 ms 36796 KB Output is correct
11 Correct 825 ms 36720 KB Output is correct
12 Correct 736 ms 36788 KB Output is correct
13 Correct 503 ms 36848 KB Output is correct
14 Correct 495 ms 36800 KB Output is correct
15 Correct 494 ms 36708 KB Output is correct
16 Correct 532 ms 36728 KB Output is correct
17 Correct 657 ms 36672 KB Output is correct

Subtask #4
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 320 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -