# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
363132 | aujasvit_datta | Nautilus (BOI19_nautilus) | C++14 | 16 ms | 10348 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define fr first
#define sc second
#define all(a) a.begin(),a.end()
int r,c,m;
string s;
string grid[102];
void count2() {
int dp[s.size() + 10][r + 10][c + 10];
//dp[i][j][k]
// whether is this position possible with the remaining string[i till end]
//check whether dp[]
//
//
int ans = 0;
//
//
for(int i = 0; i <= s.size() + 5; i++) {
for(int j = 0; j <= r + 5; j++) {
for(int k = 0; k <= c + 5; k++) {
dp[i][j][k] = false;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |