oj.uz

답안 #409191

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
409191 2021-05-20T10:40:41 Z amoo_safar Two Transportations (JOI19_transportations) C++17
100 / 100
 834 ms 48876 KB 
#include "Azer.h"
#include <bits/stdc++.h>

#define pb push_back
#define F first
#define S second

using namespace std;

typedef pair<int, int> pii;

namespace {

const int N = 2003;

int n;

int dis[N], mk[N], la = 0;
vector<pii> G[N];

int lst = 0, rq = 0;
int state = 0;
int msg = 0;
int dist = 0;

}  // namespace

void Send(int x, int bt){
	for(int i = 0; i < bt; i++){
		SendA(x & 1);
		x /= 2;
	}
}

void Find(){
	int mn = -1;

	for(int i = 0; i < n; i++){
		if(mk[i]) continue;
		if(mn == -1) mn = dis[i];
		mn = min(mn, dis[i]);
	}
	if(mn == -1) return ;
	mn -= la;
	mn = min(mn, 501);
	Send(mn, 9);

	lst = 0; rq = 9; state = 0; msg = 0;
}

void InitA(int _n, int A, vector<int> U, vector<int> V, vector<int> C) {
	fill(dis, dis + N, 500 * N);
	dis[0] = 0;

	n = _n;
	for (int i = 0; i < A; ++i) {
		G[U[i]].pb({V[i], C[i]});
		G[V[i]].pb({U[i], C[i]});
	}
	Find();
}

void Set(int idx, int dst){
	dis[idx] = dst;
	mk[idx] = 1;
	la = dst;
	for(auto [adj, w] : G[idx]){
		if(dis[adj] > dst + w)
			dis[adj] = dst + w;
	}
	Find();
}

void Response(){
	bool fl = false;
	int idx = -1;
	for(int i = 0; i < n; i++){
		if(mk[i] == 0 && dis[i] == la + msg) fl = true, idx = i;
	}
	if(!fl){
		dist = la + msg;
		state = 1;
		lst = 0; rq = 11;
		msg = 0;
		return ;
	}
	Send(idx, 11);
	Set(idx, la + msg);
}

void ReceiveA(bool x) {
	if(x)
		msg += (1 << lst);
	lst ++;
	if(lst < rq) return ;
	// cerr << "!A " << msg << ' ' << rq << '\n';
	if(state == 0)
		Response();
	else
		Set(msg, dist);
}

vector<int> Answer() {
	vector<int> ans(n);
	for(int i = 0; i < n; i++) {
		ans[i] = dis[i];
	}
	return ans;
}

#include "Baijan.h"
#include <bits/stdc++.h>

#define pb push_back
#define F first
#define S second

using namespace std;

typedef pair<int, int> pii;

namespace {

const int N = 2003;

int n;

int dis[N], mk[N], la = 0;
vector<pii> G[N];

int lst = 0, rq = 0;
int state = 0;
int msg = 0;
int dist = 0;

}  // namespace

void SendT(int x, int bt){
	for(int i = 0; i < bt; i++){
		SendB(x & 1);
		x /= 2;
	}
}

void SetT(int idx, int dst){
	dis[idx] = dst;
	la = dst;
	mk[idx] = 1;
	for(auto [adj, w] : G[idx]){
		if(dis[adj] > dst + w)
			dis[adj] = dst + w;
	}
	lst = 0; rq = 9; state = 0; msg = 0;
}
void Find(int def){
	int mn = -1;
	int idx = -1;
	for(int i = 0; i < n; i++){
		if(mk[i]) continue;
		if(mn == -1) mn = dis[i];
		mn = min(mn, dis[i]);
		if(mn == dis[i])
			idx = i;
	}
	if(mn == -1) return ;
	mn -= la;
	mn = min(mn, 501);

	SendT(min(mn, def), 9);
	if(def <= mn){
		lst = 0; rq = 11; state = 1; msg = 0;
		dist = def + la;
	} else {
		SendT(idx, 11);
		SetT(idx, mn + la);
	}
}

void InitB(int _n, int A, vector<int> U, vector<int> V, vector<int> C) {
	fill(dis, dis + N, 500 * N);
	n = _n;
	for (int i = 0; i < A; ++i) {
		G[U[i]].pb({V[i], C[i]});
		G[V[i]].pb({U[i], C[i]});
	}
	state = 0; rq = 9;
	lst = 0; msg = 0;
}

// void Response(){
// 	bool fl = false;
// 	int idx = -1;
// 	for(int i = 0; i < n; i++){
// 		if(mk[i] == 0 && dis[i] == la + msg) fl = true, idx = i;
// 	}
// 	if(!fl){
// 		dist = la + msg;
// 		state = 1;
// 		lst = 0; rq = 11;
// 		msg = 0;
// 		return ;
// 	}
// 	Send(idx, 11);
// 	Set(idx, la + msg);
// }

void ReceiveB(bool x) {
	if(x)
		msg += (1 << lst);
	lst ++;
	if(lst < rq) return ;
	// cerr << "!B " << msg << ' ' << rq << '\n';
	
	if(state == 0)
		Find(msg);
	else
		SetT(msg, dist);
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 700 ms 792 KB Output is correct
2 Correct 2 ms 580 KB Output is correct
3 Correct 653 ms 780 KB Output is correct
4 Correct 766 ms 10236 KB Output is correct
5 Correct 37 ms 900 KB Output is correct
6 Correct 568 ms 2212 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 640 KB Output is correct
2 Correct 672 ms 852 KB Output is correct
3 Correct 666 ms 884 KB Output is correct
4 Correct 800 ms 27508 KB Output is correct
5 Correct 821 ms 24060 KB Output is correct
6 Correct 77 ms 640 KB Output is correct
7 Correct 685 ms 24380 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 691 ms 812 KB Output is correct
2 Correct 2 ms 640 KB Output is correct
3 Correct 461 ms 800 KB Output is correct
4 Correct 592 ms 732 KB Output is correct
5 Correct 510 ms 732 KB Output is correct
6 Correct 477 ms 724 KB Output is correct
7 Correct 661 ms 748 KB Output is correct
8 Correct 560 ms 660 KB Output is correct
9 Correct 515 ms 796 KB Output is correct
10 Correct 582 ms 768 KB Output is correct

Subtask #4
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 282 ms 676 KB Output is correct
2 Correct 305 ms 648 KB Output is correct
3 Correct 367 ms 13176 KB Output is correct
4 Correct 253 ms 640 KB Output is correct
5 Correct 357 ms 10028 KB Output is correct
6 Correct 260 ms 640 KB Output is correct
7 Correct 260 ms 712 KB Output is correct
8 Correct 288 ms 716 KB Output is correct
9 Correct 389 ms 18164 KB Output is correct
10 Correct 376 ms 18184 KB Output is correct
11 Correct 530 ms 35736 KB Output is correct
12 Correct 469 ms 30572 KB Output is correct
13 Correct 276 ms 640 KB Output is correct
14 Correct 2 ms 640 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 282 ms 676 KB Output is correct
2 Correct 305 ms 648 KB Output is correct
3 Correct 367 ms 13176 KB Output is correct
4 Correct 253 ms 640 KB Output is correct
5 Correct 357 ms 10028 KB Output is correct
6 Correct 260 ms 640 KB Output is correct
7 Correct 260 ms 712 KB Output is correct
8 Correct 288 ms 716 KB Output is correct
9 Correct 389 ms 18164 KB Output is correct
10 Correct 376 ms 18184 KB Output is correct
11 Correct 530 ms 35736 KB Output is correct
12 Correct 469 ms 30572 KB Output is correct
13 Correct 276 ms 640 KB Output is correct
14 Correct 2 ms 640 KB Output is correct
15 Correct 331 ms 696 KB Output is correct
16 Correct 227 ms 668 KB Output is correct
17 Correct 359 ms 640 KB Output is correct
18 Correct 396 ms 10100 KB Output is correct
19 Correct 369 ms 640 KB Output is correct
20 Correct 364 ms 10348 KB Output is correct
21 Correct 331 ms 640 KB Output is correct
22 Correct 273 ms 744 KB Output is correct
23 Correct 458 ms 22252 KB Output is correct
24 Correct 487 ms 22276 KB Output is correct
25 Correct 613 ms 43508 KB Output is correct
26 Correct 508 ms 36464 KB Output is correct
27 Correct 260 ms 876 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 282 ms 676 KB Output is correct
2 Correct 305 ms 648 KB Output is correct
3 Correct 367 ms 13176 KB Output is correct
4 Correct 253 ms 640 KB Output is correct
5 Correct 357 ms 10028 KB Output is correct
6 Correct 260 ms 640 KB Output is correct
7 Correct 260 ms 712 KB Output is correct
8 Correct 288 ms 716 KB Output is correct
9 Correct 389 ms 18164 KB Output is correct
10 Correct 376 ms 18184 KB Output is correct
11 Correct 530 ms 35736 KB Output is correct
12 Correct 469 ms 30572 KB Output is correct
13 Correct 276 ms 640 KB Output is correct
14 Correct 2 ms 640 KB Output is correct
15 Correct 331 ms 696 KB Output is correct
16 Correct 227 ms 668 KB Output is correct
17 Correct 359 ms 640 KB Output is correct
18 Correct 396 ms 10100 KB Output is correct
19 Correct 369 ms 640 KB Output is correct
20 Correct 364 ms 10348 KB Output is correct
21 Correct 331 ms 640 KB Output is correct
22 Correct 273 ms 744 KB Output is correct
23 Correct 458 ms 22252 KB Output is correct
24 Correct 487 ms 22276 KB Output is correct
25 Correct 613 ms 43508 KB Output is correct
26 Correct 508 ms 36464 KB Output is correct
27 Correct 260 ms 876 KB Output is correct
28 Correct 438 ms 640 KB Output is correct
29 Correct 423 ms 652 KB Output is correct
30 Correct 588 ms 24060 KB Output is correct
31 Correct 440 ms 656 KB Output is correct
32 Correct 455 ms 21108 KB Output is correct
33 Correct 378 ms 736 KB Output is correct
34 Correct 447 ms 768 KB Output is correct
35 Correct 424 ms 896 KB Output is correct
36 Correct 604 ms 24828 KB Output is correct
37 Correct 575 ms 24724 KB Output is correct
38 Correct 731 ms 48876 KB Output is correct
39 Correct 663 ms 44272 KB Output is correct
40 Correct 407 ms 896 KB Output is correct

Subtask #7
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 700 ms 792 KB Output is correct
2 Correct 2 ms 580 KB Output is correct
3 Correct 653 ms 780 KB Output is correct
4 Correct 766 ms 10236 KB Output is correct
5 Correct 37 ms 900 KB Output is correct
6 Correct 568 ms 2212 KB Output is correct
7 Correct 2 ms 640 KB Output is correct
8 Correct 672 ms 852 KB Output is correct
9 Correct 666 ms 884 KB Output is correct
10 Correct 800 ms 27508 KB Output is correct
11 Correct 821 ms 24060 KB Output is correct
12 Correct 77 ms 640 KB Output is correct
13 Correct 685 ms 24380 KB Output is correct
14 Correct 691 ms 812 KB Output is correct
15 Correct 2 ms 640 KB Output is correct
16 Correct 461 ms 800 KB Output is correct
17 Correct 592 ms 732 KB Output is correct
18 Correct 510 ms 732 KB Output is correct
19 Correct 477 ms 724 KB Output is correct
20 Correct 661 ms 748 KB Output is correct
21 Correct 560 ms 660 KB Output is correct
22 Correct 515 ms 796 KB Output is correct
23 Correct 582 ms 768 KB Output is correct
24 Correct 282 ms 676 KB Output is correct
25 Correct 305 ms 648 KB Output is correct
26 Correct 367 ms 13176 KB Output is correct
27 Correct 253 ms 640 KB Output is correct
28 Correct 357 ms 10028 KB Output is correct
29 Correct 260 ms 640 KB Output is correct
30 Correct 260 ms 712 KB Output is correct
31 Correct 288 ms 716 KB Output is correct
32 Correct 389 ms 18164 KB Output is correct
33 Correct 376 ms 18184 KB Output is correct
34 Correct 530 ms 35736 KB Output is correct
35 Correct 469 ms 30572 KB Output is correct
36 Correct 276 ms 640 KB Output is correct
37 Correct 2 ms 640 KB Output is correct
38 Correct 331 ms 696 KB Output is correct
39 Correct 227 ms 668 KB Output is correct
40 Correct 359 ms 640 KB Output is correct
41 Correct 396 ms 10100 KB Output is correct
42 Correct 369 ms 640 KB Output is correct
43 Correct 364 ms 10348 KB Output is correct
44 Correct 331 ms 640 KB Output is correct
45 Correct 273 ms 744 KB Output is correct
46 Correct 458 ms 22252 KB Output is correct
47 Correct 487 ms 22276 KB Output is correct
48 Correct 613 ms 43508 KB Output is correct
49 Correct 508 ms 36464 KB Output is correct
50 Correct 260 ms 876 KB Output is correct
51 Correct 438 ms 640 KB Output is correct
52 Correct 423 ms 652 KB Output is correct
53 Correct 588 ms 24060 KB Output is correct
54 Correct 440 ms 656 KB Output is correct
55 Correct 455 ms 21108 KB Output is correct
56 Correct 378 ms 736 KB Output is correct
57 Correct 447 ms 768 KB Output is correct
58 Correct 424 ms 896 KB Output is correct
59 Correct 604 ms 24828 KB Output is correct
60 Correct 575 ms 24724 KB Output is correct
61 Correct 731 ms 48876 KB Output is correct
62 Correct 663 ms 44272 KB Output is correct
63 Correct 407 ms 896 KB Output is correct
64 Correct 538 ms 944 KB Output is correct
65 Correct 739 ms 26480 KB Output is correct
66 Correct 792 ms 23456 KB Output is correct
67 Correct 556 ms 928 KB Output is correct
68 Correct 580 ms 928 KB Output is correct
69 Correct 761 ms 47732 KB Output is correct
70 Correct 834 ms 39540 KB Output is correct
71 Correct 575 ms 4976 KB Output is correct
72 Correct 590 ms 1156 KB Output is correct