Submission #2107468


Source Code Expand

#include <queue>
#include <vector>
#include <iostream>
using namespace std;
const int inf = 1012345678;
int n, m, s, p[4035], b[4035], dist[4035], np[4035]; bool vis[4035];
int main() {
	cin >> n >> m; s = 2 * n + 1;
	for(int i = 0; i < s; i++) cin >> p[i], p[i]--, dist[i] = inf;
	for(int i = 0; i < m; i++) cin >> b[i], vis[b[i]] = true;
	queue<int> q1; q1.push(0); dist[0] = 0;
	while(!q1.empty()) {
		int u = q1.front(); q1.pop();
		for(int i = 0; i < m; i++) {
			if(dist[(u + b[i]) % s] == inf) {
				dist[(u + b[i]) % s] = dist[u] + 1;
				q1.push((u + b[i]) % s);
			}
		}
	}
	int ret = inf, sa = (s - p[0]) % s, pw = 1;
	for(int i = 0; i < 2 * s; i++) {
		bool flag = true;
		for(int j = 1; j < s; j++) {
			if((p[j] - p[0] + s) % s != j) flag = false;
		}
		if(flag) ret = min(ret, i + dist[sa]);
		vector<int> v;
		for(int j = 0; j < s; j++) {
			if(vis[j] && !vis[(j * 2) % s]) {
				v.push_back((j * 2) % s);
			}
		}
		pw = 2 * pw % s; v.push_back(pw);
		for(int j = 0; j < s; j++) np[(j * 2) % s] = p[j];
		for(int j = 0; j < s; j++) p[j] = np[j];
		for(int j : v) vis[j] = true;
		vector<vector<int> > d(s);
		for(int j = 0; j < s; j++) {
			if(dist[j] != inf) {
				d[dist[j]].push_back(j);
			}
		}
		for(int j = 0; j < s - 1; j++) {
			for(int k : d[j]) {
				if(dist[k] != j) continue;
				for(int l : v) {
					int nxt = (k + l) % s;
					if(dist[nxt] > dist[k] + 1) {
						dist[nxt] = dist[k] + 1;
						d[dist[nxt]].push_back(nxt);
					}
				}
			}
		}
	}
	cout << (ret != inf ? ret : -1) << endl;
	return 0;
}

Submission Info

Submission Time
Task B - 天下一マジック
User square1001
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1595 Byte
Status WA
Exec Time 772 ms
Memory 552 KB

Judge Result

Set Name level1 level2 All
Score / Max Score 20 / 20 80 / 80 0 / 100
Status
AC × 16
AC × 36
AC × 72
WA × 3
Set Name Test Cases
level1 level1-00, level1-01, level1-02, level1-03, level1-04, level1-05, level1-06, level1-07, level1-08, level1-09, level1-10, level1-11, level1-12, level1-13, level1-14, level1-15
level2 level1-00, level1-01, level1-02, level1-03, level1-04, level1-05, level1-06, level1-07, level1-08, level1-09, level1-10, level1-11, level1-12, level1-13, level1-14, level1-15, level2-00, level2-01, level2-02, level2-03, level2-04, level2-05, level2-06, level2-07, level2-08, level2-09, level2-10, level2-11, level2-12, level2-13, level2-14, level2-15, level2-16, level2-17, level2-18, level2-19
All level1-00, level1-01, level1-02, level1-03, level1-04, level1-05, level1-06, level1-07, level1-08, level1-09, level1-10, level1-11, level1-12, level1-13, level1-14, level1-15, level2-00, level2-01, level2-02, level2-03, level2-04, level2-05, level2-06, level2-07, level2-08, level2-09, level2-10, level2-11, level2-12, level2-13, level2-14, level2-15, level2-16, level2-17, level2-18, level2-19, level3-00, level3-01, level3-02, level3-03, level3-04, level3-05, level3-06, level3-07, level3-08, level3-09, level3-10, level3-11, level3-12, level3-13, level3-14, level3-15, level3-16, level3-17, level3-18, level3-19, level3-20, level3-21, level3-22, level3-23, level3-24, level3-25, level3-26, level3-27, level3-28, level3-29, level3-30, level3-31, level3-32, level3-33, level3-34, level3-35, level3-36, level3-37, level3-38
Case Name Status Exec Time Memory
level1-00 AC 1 ms 256 KB
level1-01 AC 1 ms 256 KB
level1-02 AC 1 ms 256 KB
level1-03 AC 1 ms 256 KB
level1-04 AC 1 ms 256 KB
level1-05 AC 1 ms 256 KB
level1-06 AC 1 ms 256 KB
level1-07 AC 1 ms 256 KB
level1-08 AC 1 ms 256 KB
level1-09 AC 1 ms 256 KB
level1-10 AC 1 ms 256 KB
level1-11 AC 1 ms 256 KB
level1-12 AC 1 ms 256 KB
level1-13 AC 1 ms 256 KB
level1-14 AC 1 ms 256 KB
level1-15 AC 1 ms 256 KB
level2-00 AC 25 ms 256 KB
level2-01 AC 702 ms 552 KB
level2-02 AC 698 ms 552 KB
level2-03 AC 673 ms 552 KB
level2-04 AC 706 ms 552 KB
level2-05 AC 695 ms 552 KB
level2-06 AC 697 ms 552 KB
level2-07 AC 710 ms 552 KB
level2-08 AC 698 ms 552 KB
level2-09 AC 702 ms 552 KB
level2-10 AC 675 ms 552 KB
level2-11 AC 751 ms 552 KB
level2-12 AC 754 ms 552 KB
level2-13 AC 697 ms 552 KB
level2-14 AC 709 ms 552 KB
level2-15 AC 697 ms 552 KB
level2-16 AC 704 ms 552 KB
level2-17 AC 676 ms 552 KB
level2-18 AC 753 ms 552 KB
level2-19 AC 642 ms 552 KB
level3-00 AC 1 ms 256 KB
level3-01 AC 31 ms 256 KB
level3-02 AC 735 ms 488 KB
level3-03 AC 760 ms 488 KB
level3-04 AC 33 ms 256 KB
level3-05 AC 761 ms 512 KB
level3-06 AC 761 ms 384 KB
level3-07 AC 763 ms 384 KB
level3-08 AC 761 ms 384 KB
level3-09 AC 767 ms 384 KB
level3-10 AC 764 ms 384 KB
level3-11 AC 698 ms 512 KB
level3-12 AC 739 ms 496 KB
level3-13 AC 760 ms 384 KB
level3-14 AC 762 ms 384 KB
level3-15 AC 758 ms 500 KB
level3-16 AC 759 ms 492 KB
level3-17 AC 758 ms 508 KB
level3-18 AC 763 ms 512 KB
level3-19 AC 758 ms 500 KB
level3-20 AC 757 ms 384 KB
level3-21 AC 763 ms 496 KB
level3-22 AC 759 ms 488 KB
level3-23 AC 757 ms 492 KB
level3-24 WA 698 ms 492 KB
level3-25 AC 772 ms 496 KB
level3-26 AC 726 ms 492 KB
level3-27 AC 756 ms 492 KB
level3-28 AC 760 ms 384 KB
level3-29 AC 763 ms 384 KB
level3-30 AC 762 ms 384 KB
level3-31 AC 762 ms 384 KB
level3-32 AC 757 ms 384 KB
level3-33 AC 762 ms 384 KB
level3-34 AC 762 ms 384 KB
level3-35 AC 761 ms 384 KB
level3-36 AC 762 ms 384 KB
level3-37 WA 1 ms 256 KB
level3-38 WA 639 ms 492 KB