oj.uz

Submission #236972

# Submission time Handle Problem Language Result Execution time Memory
236972 2020-06-04T06:48:17 Z Atalasion Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
0 / 100
 409 ms 809660 KB 
//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.0

# Verdict Execution time Memory Grader output
1 Correct 409 ms 809592 KB Output is correct
2 Correct 386 ms 809660 KB Output is correct
3 Correct 386 ms 809536 KB Output is correct
4 Incorrect 369 ms 809592 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 409 ms 809592 KB Output is correct
2 Correct 386 ms 809660 KB Output is correct
3 Correct 386 ms 809536 KB Output is correct
4 Incorrect 369 ms 809592 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 378 ms 809592 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 409 ms 809592 KB Output is correct
2 Correct 386 ms 809660 KB Output is correct
3 Correct 386 ms 809536 KB Output is correct
4 Incorrect 369 ms 809592 KB Output isn't correct
5 Halted 0 ms 0 KB -