oj.uz

답안 #237301

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
237301 2020-06-05T18:39:00 Z limabeans Amusement Park (JOI17_amusement_park) C++17
18 / 100
 47 ms 6432 KB 
#include "Joi.h"
#include <bits/stdc++.h>
using namespace std;

template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl




typedef long long ll;
const int maxn = 10005;


static vector<int> g[maxn];
static vector<int> path;
static bool viz[maxn];

// void MessageBoard(int attr, int msg) {
// }

static void dfs(int at) {
    path.push_back(at);
    viz[at]=true;
    for (int to: g[at]) {
	if (viz[to]) continue;
	dfs(to);
	path.push_back(at);
    }
}


static bool check3(int n, int m, int a[], int b[]) {
    if (m != n-1) return false;
    for (int i=0; i<m; i++) {
	if (a[i]==i && b[i]==i+1) continue;
	return false;
    }
    return true;
}

void Joi(int n, int m, int a[], int b[], long long x, int t) {
    for (int i=0; i<=n; i++) {
	g[i].clear();
    }
    path.clear();
    memset(viz,false,sizeof(viz));
    
    for (int i=0; i<m; i++) {
	g[a[i]].push_back(b[i]);
	g[b[i]].push_back(a[i]);
    }
    for (int i=0; i<n; i++) {
	sort(g[i].begin(), g[i].end());
    }


    if (check3(n, m, a, b)) {
	for (int i=0; i<n; i++) {
	    ll j=i%60;
	    MessageBoard(i, x>>j&1);
	}
	return;
    }
    
    dfs(0);
    memset(viz,false,sizeof(viz));
    ll j=0;
    for (int at: path) {
	if (viz[at]) continue;
	viz[at]=true;
	MessageBoard(at, x>>j&1);
	j++;
    }
}

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

template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl




typedef long long ll;
const ll mod = 1e9+7;
const int maxn = 10005;
const int inf = 1e9;

static set<int> g[maxn];
static vector<int> path;
static bool viz[maxn];
int nodes;


// int Move(int dest) {
//     cout<<"Move: "<<dest<<endl;
//     return 1;
// }

static void dfs(int at) {
    path.push_back(at);
    viz[at]=true;
    for (int to: g[at]) {
	if (viz[to]) continue;
	dfs(to);
	path.push_back(at);
    }
}


vector<int> dij(int src) {
    int n = nodes;
    vector<int> dist(n, inf);
    vector<int> par(n, -1);
    dist[src] = 0;

    queue<int> qq;
    qq.push(src);
    while (qq.size()) {
	int at = qq.front();
	qq.pop();
	for (int to: g[at]) {
	    if (dist[to]>1+dist[at]) {
		dist[to]=1+dist[at];
		par[to]=at;
		qq.push(to);
	    }
	}
    }

    vector<int> res;
    int at = 0;
    while (at != src) {
	res.push_back(at);
	at=par[at];
    }
    reverse(res.begin(), res.end());
    return res;
}


static bool check3(int n, int m, int a[], int b[]) {
    if (m != n-1) return false;
    for (int i=0; i<m; i++) {
	if (a[i]==i && b[i]==i+1) continue;
	return false;
    }
    return true;
}


long long Ioi(int n, int m, int a[], int b[], int p, int v, int t) {
    nodes = n;
    for (int i=0; i<=n; i++) {
	g[i].clear();
    }
    path.clear();
    memset(viz,false,sizeof(viz));
    
    for (int i=0; i<m; i++) {
	g[a[i]].insert(b[i]);
	g[b[i]].insert(a[i]);
    }


    if (check3(n, m, a, b)) {
	ll res=0;
	int at=p;
	while (at%60 != 0) {
	    assert(at-1>=0);
	    v=Move(at-1);
	    at--;
	}
	assert(at%60==0 && at>=0 && at<n);
	res=v;
	for (ll j=1; j<=min(n-1,59); j++) {
	    ll val = Move(at+1);
	    assert(at+1<n);
	    res=res|(val<<j);
	    at++;
	}

	return res;
    }

    int cur=p;
    vector<int> pathto0 = dij(cur);
    for (int x: pathto0) {
	assert(g[cur].count(x));
	assert(x!=-1);
	Move(x);
	cur=x;
    }

    assert(cur==0);
    int to=*g[cur].begin();
    Move(to);
    cur=to;

    dfs(0);
    memset(viz,false,sizeof(viz));

    // for (int x: path) {
    // 	cout<<x<<" ";
    // }
    // cout<<endl;
    
    ll j=0;
    ll ans = 0;
    for (int nxt: path) {
	assert(g[cur].count(nxt));
	ll val = Move(nxt);
	cur=nxt;
	if (viz[nxt]) {
	    continue;
	}
	viz[nxt]=true;
	if (j>=60) {
	    break;
	}

	ans = ans | (val<<j);
	j++;
    }
    
    return ans;
}



// int main() {
//     //long long Ioi(int n, int m, int a[], int b[], int p, int v, int t) {
//     int a[] = {0,1,2,2};
//     int b[] = {1,2,0,3};
//     ll res  = Ioi(4,4,a,b,3,0,0);
//     watch(res);
//     return 0;
// }

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 1552 KB Output is correct
2 Correct 10 ms 1792 KB Output is correct
3 Correct 10 ms 1676 KB Output is correct
4 Correct 10 ms 1792 KB Output is correct
5 Correct 10 ms 1548 KB Output is correct
6 Correct 10 ms 1792 KB Output is correct
7 Correct 10 ms 1780 KB Output is correct
8 Correct 10 ms 1768 KB Output is correct
9 Correct 10 ms 1676 KB Output is correct
10 Correct 10 ms 1792 KB Output is correct
11 Correct 15 ms 2240 KB Output is correct
12 Correct 9 ms 1792 KB Output is correct
13 Correct 10 ms 1772 KB Output is correct
14 Correct 11 ms 1720 KB Output is correct
15 Correct 10 ms 1776 KB Output is correct
16 Correct 10 ms 1784 KB Output is correct
17 Correct 10 ms 1772 KB Output is correct
18 Correct 10 ms 1676 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 44 ms 6244 KB Output is correct
2 Correct 43 ms 6016 KB Output is correct
3 Correct 41 ms 6116 KB Output is correct
4 Correct 26 ms 4136 KB Output is correct
5 Correct 27 ms 4444 KB Output is correct
6 Correct 26 ms 4300 KB Output is correct
7 Correct 27 ms 4376 KB Output is correct
8 Correct 27 ms 4344 KB Output is correct
9 Correct 27 ms 4352 KB Output is correct
10 Correct 27 ms 4096 KB Output is correct
11 Correct 27 ms 4116 KB Output is correct
12 Correct 25 ms 3816 KB Output is correct
13 Correct 25 ms 3800 KB Output is correct
14 Correct 26 ms 4020 KB Output is correct
15 Correct 26 ms 4044 KB Output is correct
16 Correct 26 ms 4040 KB Output is correct
17 Correct 27 ms 4144 KB Output is correct
18 Correct 26 ms 4144 KB Output is correct
19 Correct 28 ms 4148 KB Output is correct
20 Correct 23 ms 4472 KB Output is correct
21 Correct 23 ms 4316 KB Output is correct
22 Correct 28 ms 4428 KB Output is correct
23 Correct 27 ms 4348 KB Output is correct
24 Correct 27 ms 4244 KB Output is correct
25 Correct 28 ms 4364 KB Output is correct
26 Correct 30 ms 4340 KB Output is correct
27 Correct 28 ms 4300 KB Output is correct
28 Correct 26 ms 4332 KB Output is correct
29 Correct 26 ms 4044 KB Output is correct
30 Correct 25 ms 4276 KB Output is correct
31 Correct 10 ms 1784 KB Output is correct
32 Correct 10 ms 1540 KB Output is correct
33 Correct 10 ms 1676 KB Output is correct
34 Correct 10 ms 1908 KB Output is correct
35 Correct 10 ms 1668 KB Output is correct
36 Correct 10 ms 1792 KB Output is correct
37 Correct 10 ms 1540 KB Output is correct
38 Correct 10 ms 1788 KB Output is correct
39 Correct 10 ms 1764 KB Output is correct
40 Correct 10 ms 1540 KB Output is correct
41 Correct 10 ms 1792 KB Output is correct
42 Correct 10 ms 1776 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 1668 KB Output is correct
2 Correct 10 ms 1668 KB Output is correct
3 Incorrect 10 ms 1772 KB Wrong Answer [6]
4 Halted 0 ms 0 KB -

Subtask #4
0.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 6024 KB Output is correct
2 Correct 41 ms 6116 KB Output is correct
3 Correct 47 ms 6432 KB Output is correct
4 Partially correct 33 ms 3916 KB Partially correct
5 Incorrect 32 ms 4428 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 45 ms 6200 KB Output is correct
2 Correct 47 ms 6164 KB Output is correct
3 Correct 42 ms 6016 KB Output is correct
4 Incorrect 28 ms 4140 KB Output isn't correct
5 Halted 0 ms 0 KB -