Submission #229699

#	Time	Username	Problem	Language	Result	Execution time	Memory
229699		hanagasumi	Snake Escaping (JOI18_snake_escaping)	C++17	0 / 100	52 ms	65540 KiB

snake_escaping

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <deque>
#include <map>
#include <set>
#include <complex>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <random>

#define ft first
#define sc second
#define pb push_back
#define len(v) (int)v.size()
#define int ll

using namespace std;
typedef long long ll;

const int nnn = (1 << 10);
const int mmm = 59049;

short dp[nnn][mmm];

signed main() {
	#ifdef PC
		freopen("in.txt", "r", stdin);
		freopen("out.txt", "w", stdout);
	#endif
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	for (int i = 0; i < nnn; i++) {
		for (int j = 0; j < mmm; j++) {
			dp[i][j] = 0;
		}
	}
	int L;
	cin >> L;
	// solve_stupid(L);

	string s;
	cin >> s;


}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 7
• Subtask 3: 0 / 10
• Subtask 4: 0 / 53
• Subtask 5: 0 / 25