Submission #236971

#TimeUsernameProblemLanguageResultExecution timeMemory
236971AtalasionGrowing Vegetable is Fun 3 (JOI19_ho_t3)C++14
0 / 100
5 ms384 KiB
//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);
	cout << 0;










	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...