oj.uz

Submission #27141

# Submission time Handle Problem Language Result Execution time Memory
27141 2017-07-09T14:31:05 Z zoomswk Amusement Park (JOI17_amusement_park) C++14
18 / 100
 2929 ms 31632 KB 
#include "Joi.h"
#include <bits/stdc++.h>
using namespace std;

namespace GUI{

vector<pair<int, int>> way[10005];
int use[10005];
int done[10005];
int done_cnt;
int id[10005];
bitset<10000> take[10005];
int dist[10005];

queue<pair<int, int>> q;

void init(int pos){
    if(done_cnt == 60) return;
    if(id[pos]) return;
    id[pos] = ++done_cnt;
    if(done_cnt == 60) return;
    for(pair<int, int> v : way[pos]) if(!id[v.first] && done_cnt < 60) use[v.second] = 1, init(v.first);
    return;
}

void dfs(int pos, int from){
    if(id[pos]) return;
    for(int i=0; i<10000; i++) dist[i] = 1e9;
    q.push({0, pos});
    while(!q.empty()){
        int d = q.front().first, pos = q.front().second;
        q.pop();
        if(d >= dist[pos]) continue;
        dist[pos] = d;
        for(pair<int, int> x : way[pos]) if(use[x.second]) q.push({d+1, x.first});
    }
    int mxdist=0, mxer=0;
    for(int i=0; i<10000; i++){
        take[pos][i] = take[from][i];
        if(take[pos][i]){
            if(dist[i] > mxdist){
                mxdist = dist[i];
                mxer = i;
            }
        }
    }
    take[pos][mxer] = 0;
    take[pos][pos] = 1;
    id[pos] = id[mxer];
    for(pair<int, int> v : way[pos]){
        if(id[v.first]) continue;
        use[v.second] = 1;
        dfs(v.first, pos);
    }
    return;
}

int bit[65];

void Joi(int N, int M, int A[], int B[], long long X, int T) {
    for(int i=0; i<M; i++) way[A[i]].push_back({B[i], i}), way[B[i]].push_back({A[i], i});
    init(0);
    for(int i=0; i<N; i++){
        if(id[i]){
            for(int j=0; j<N; j++) if(id[j]) take[i][j] = 1;
        }
    }
    for(int i=0; i<N; i++){
        if(take[0][i]) for(pair<int, int> v : way[i]) use[v.second] = 1, dfs(v.first, i);
    }
    for(int i=1; i<=60; i++){
        if(X&1) bit[i] = 1;
        else bit[i] = 0;
        X >>= 1;
    }
    for(int i=0; i<N; i++) if(bit[id[i]] != 0 && bit[id[i]] != 1){ exit(1); }
    for(int i=0; i<N; i++) MessageBoard(i, bit[id[i]]);
    return;
}


}

void Joi(int N, int M, int A[], int B[], long long X, int T){
    GUI::Joi(N, M, A, B, X, T);
}

#include "Ioi.h"
#include <bits/stdc++.h>
using namespace std;

vector<pair<int, int>> way[10005];
int use[10005];
int done[10005];
int done_cnt;
int id[10005];
bitset<10000> take[10005];
int dist[10005];

void init(int pos){
    if(done_cnt == 60) return;
    if(id[pos]) return;
    id[pos] = ++done_cnt;
    if(done_cnt == 60) return;
    for(pair<int, int> v : way[pos]) if(!id[v.first] && done_cnt < 60) use[v.second] = 1, init(v.first);
    return;
}

queue<pair<int, int>> q;

void dfs(int pos, int from){
    if(id[pos]) return;
    for(int i=0; i<10000; i++) dist[i] = 1e9;
    q.push({0, pos});
    while(!q.empty()){
        int d = q.front().first, pos = q.front().second;
        q.pop();
        if(d >= dist[pos]) continue;
        dist[pos] = d;
        for(pair<int, int> x : way[pos]) if(use[x.second]) q.push({d+1, x.first});
    }
    int mxdist=0, mxer=-1;
    for(int i=0; i<10000; i++){
        take[pos][i] = take[from][i];
        if(take[pos][i]){
            if(dist[i] > mxdist){
                mxdist = dist[i];
                mxer = i;
            }
        }
    }
    if(mxer == -1){ printf("!!!\n"); }
    take[pos][mxer] = 0;
    take[pos][pos] = 1;
    id[pos] = id[mxer];
    for(pair<int, int> v : way[pos]){
        if(id[v.first]) continue;
        use[v.second] = 1;
        dfs(v.first, pos);
    }
    return;
}

int res[65];

int vs[10005];

int gbP;

void get_ans(int pos){
    vs[pos] = 1;
    //printf("VS %d\n", pos);
    for(pair<int, int> v : way[pos]){
        //printf("TRY %d\n", v.first);
        if((!take[gbP][v.first]) || vs[v.first]) continue;
        int x = Move(v.first);
        res[id[v.first]] = x;
        get_ans(v.first);
        Move(pos);
    }
    return;
}

long long Ioi(int N, int M, int A[], int B[], int P, int V, int T) {
    gbP = P;
    for(int i=0; i<M; i++) way[A[i]].push_back({B[i], i}), way[B[i]].push_back({A[i], i});
    init(0);
    for(int i=0; i<N; i++){
        if(id[i]){
            for(int j=0; j<N; j++) if(id[j]) take[i][j] = 1;
        }
    }
    for(int i=0; i<N; i++){
        if(take[0][i]) for(pair<int, int> v : way[i]) use[v.second] = 1, dfs(v.first, i);
    }
    res[id[P]] = V;
    get_ans(P);
    long long X = 0;
    for(int i=60; i>=1; i--){
        X <<= 1;
        X += res[i];
    }
    return X;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 30120 KB Output is correct
2 Correct 6 ms 30120 KB Output is correct
3 Correct 15 ms 30120 KB Output is correct
4 Correct 0 ms 30120 KB Output is correct
5 Correct 0 ms 30120 KB Output is correct
6 Correct 6 ms 30120 KB Output is correct
7 Correct 19 ms 30120 KB Output is correct
8 Correct 18 ms 30120 KB Output is correct
9 Correct 18 ms 30120 KB Output is correct
10 Correct 6 ms 30120 KB Output is correct
11 Correct 9 ms 30384 KB Output is correct
12 Correct 0 ms 30120 KB Output is correct
13 Correct 18 ms 30120 KB Output is correct
14 Correct 22 ms 30120 KB Output is correct
15 Correct 18 ms 30120 KB Output is correct
16 Correct 18 ms 30120 KB Output is correct
17 Correct 18 ms 30120 KB Output is correct
18 Correct 18 ms 30120 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 9 ms 15700 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 30120 KB Output is correct
2 Correct 0 ms 30120 KB Output is correct
3 Correct 3 ms 30120 KB Output is correct
4 Correct 182 ms 30384 KB Output is correct
5 Correct 202 ms 30384 KB Output is correct
6 Correct 175 ms 30384 KB Output is correct
7 Correct 168 ms 30384 KB Output is correct
8 Correct 162 ms 30384 KB Output is correct
9 Correct 2835 ms 31632 KB Output is correct
10 Correct 2865 ms 31632 KB Output is correct
11 Correct 2929 ms 31628 KB Output is correct
12 Correct 0 ms 30120 KB Output is correct
13 Correct 0 ms 30120 KB Output is correct
14 Correct 0 ms 30120 KB Output is correct
15 Correct 0 ms 30120 KB Output is correct

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Runtime error 9 ms 15700 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 53 ms 15700 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -