Submission #285130

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
285130	2020-08-28T10:45:01 Z	cookiedoth	Arranging Shoes (IOI19_shoes)	C++14	10 / 100	1000 ms	1048580 KB

shoes

/*

Code for problem A by cookiedoth
Generated 28 Aug 2020 at 01.11 PM


______▄███████▄_______
______█▄█████▄█_______
______█▼▼▼▼▼█_______
_____██________ ██______
______█▲▲▲▲▲█_______
______█████████_______
_______██____ ██________

=_=
¯\_(ツ)_/¯
o_O

*/

#include "shoes.h"
#include <iostream>
#include <fstream>
#include <vector>
#include <set>
#include <map>
#include <bitset>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <functional>
#include <unordered_set>
#include <unordered_map>
#include <string>
#include <queue>
#include <deque>
#include <stack>
#include <complex>
#include <cassert>
#include <random>
#include <cstring>
#include <numeric>
#include <random>
#define ll long long
#define ld long double
#define null NULL
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define debug(a) cerr << #a << " = " << a << endl
#define forn(i, n) for (int i = 0; i < n; ++i)
#define length(a) (int)a.size()

using namespace std;

template<class T> int chkmax(T &a, T b) {
	if (b > a) {
		a = b;
		return 1;
	}
	return 0;
}

template<class T> int chkmin(T &a, T b) {
	if (b < a) {
		a = b;
		return 1;
	}
	return 0;
}

template<class iterator> void output(iterator begin, iterator end, ostream& out = cerr) {
	while (begin != end) {
		out << (*begin) << " ";
		begin++;
	}
	out << endl;
}

template<class T> void output(T x, ostream& out = cerr) {
	output(x.begin(), x.end(), out);
}

void fast_io() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
}

const int INF = 1e9 + 228;

map<vector<int>, int> dp;

ll count_swaps(vector<int> s) {
	queue<vector<int> > q;
	q.push(s);
	dp[s] = 0;
	while (!q.empty()) {
		vector<int> v = q.front();
		int cur_d = dp[v];
		q.pop();
		int ok = 1;
		for (int i = 0; i < (int)v.size(); i += 2) {
			if (v[i] + v[i + 1] != 0 || v[i] > v[i + 1]) {
				ok = 0;
				break;
			}
		}
		if (ok) {
			return dp[v];
		}
		for (int i = 0; i < (int)v.size() - 1; ++i) {
			swap(v[i], v[i + 1]);
			if (dp.find(v) == dp.end()) {
				dp[v] = cur_d + 1;
				q.push(v);
			}
			swap(v[i], v[i + 1]);
		}
	}
}

Compilation message

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:95:22: warning: control reaches end of non-void function [-Wreturn-type]
   95 |  queue<vector<int> > q;
      |                      ^

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct

Subtask #2
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	1 ms	256 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	0 ms	256 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	1 ms	256 KB	Output is correct
14	Correct	2 ms	512 KB	Output is correct
15	Correct	2 ms	384 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	10 ms	1024 KB	Output is correct
19	Correct	19 ms	1920 KB	Output is correct
20	Correct	12 ms	1140 KB	Output is correct
21	Correct	1 ms	384 KB	Output is correct
22	Correct	4 ms	512 KB	Output is correct
23	Correct	16 ms	1152 KB	Output is correct
24	Execution timed out	1084 ms	74260 KB	Time limit exceeded
25	Halted	0 ms	0 KB	-

Subtask #3
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	0 ms	256 KB	Output is correct
7	Correct	0 ms	256 KB	Output is correct
8	Correct	0 ms	256 KB	Output is correct
9	Correct	0 ms	256 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	1 ms	256 KB	Output is correct
12	Correct	0 ms	256 KB	Output is correct
13	Correct	19 ms	1152 KB	Output is correct
14	Execution timed out	1088 ms	30116 KB	Time limit exceeded
15	Halted	0 ms	0 KB	-

Subtask #4
0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Runtime error	647 ms	1048580 KB	Execution killed with signal 9
6	Halted	0 ms	0 KB	-

Subtask #5
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	1 ms	256 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	0 ms	256 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	1 ms	256 KB	Output is correct
14	Correct	2 ms	512 KB	Output is correct
15	Correct	2 ms	384 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	10 ms	1024 KB	Output is correct
19	Correct	19 ms	1920 KB	Output is correct
20	Correct	12 ms	1140 KB	Output is correct
21	Correct	1 ms	384 KB	Output is correct
22	Correct	4 ms	512 KB	Output is correct
23	Correct	16 ms	1152 KB	Output is correct
24	Execution timed out	1084 ms	74260 KB	Time limit exceeded
25	Halted	0 ms	0 KB	-

Subtask #6
0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	1 ms	256 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	0 ms	256 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	1 ms	256 KB	Output is correct
14	Correct	2 ms	512 KB	Output is correct
15	Correct	2 ms	384 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	10 ms	1024 KB	Output is correct
19	Correct	19 ms	1920 KB	Output is correct
20	Correct	12 ms	1140 KB	Output is correct
21	Correct	1 ms	384 KB	Output is correct
22	Correct	4 ms	512 KB	Output is correct
23	Correct	16 ms	1152 KB	Output is correct
24	Execution timed out	1084 ms	74260 KB	Time limit exceeded
25	Halted	0 ms	0 KB	-

Submission #285130

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 0 / 20.0

Subtask #3 0 / 20.0

Subtask #4 0 / 15.0

Subtask #5 0 / 20.0

Subtask #6 0 / 15.0

Subtask #1
10.0 / 10.0

Subtask #2
0 / 20.0

Subtask #3
0 / 20.0

Subtask #4
0 / 15.0

Subtask #5
0 / 20.0

Subtask #6
0 / 15.0