# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
292585 | kshitij_sodani | Furniture (JOI20_furniture) | C++14 | 397 ms | 18168 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;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first
#define b second
#define endl '\n'
int n,m;
int it[1001][1001];
int vis[1001][1001];
int vis2[1001][1001];
int val[1001][1001];
int co[3001];
int cal(int i,int j){
int co=0;
if(i+1<n){
co+=val[i+1][j];
}
if(j+1<m){
co+=val[i][j+1];
}
return co;
}
int cal2(int i,int j){
int co=0;
if(i>0){
co+=val[i-1][j];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |