제출 #236972

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
236972		Atalasion	Growing Vegetable is Fun 3 (JOI19_ho_t3)	C++14	0 / 100	409 ms	809660 KiB

joi2019_ho_t3

//khodaya khodet komak kon
#include <bits/stdc++.h>

#define F first
#define S second
#define pb push_back
#define all(x) x.begin(), x.end()
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")


using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

const int N = 400 + 10;
const ll MOD = 1000000000 + 7;
const ll INF = 1000000010;
const ll LOG = 25;

int dp[N][N][N][3];

int32_t main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) for (int k = 0; k < N; k++) dp[i][j][k][0] = dp[i][j][k][1] = dp[i][j][k][2] = 102 * i;
	cout << 0;










	return 0;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 55
• Subtask 3: 0 / 15
• Subtask 4: 0 / 25