# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1037861 | mateuszwes | Bitaro the Brave (JOI19_ho_t1) | C++17 | 203 ms | 159312 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>
#define ll long long
#define ull unsigned long long
#define i128 __int128
#define F first
#define S second
#define pb push_back
#define pi pair<int,int>
#define pl pair<ll,ll>
using namespace std;
constexpr int debug = 0;
constexpr int N = 3007;
ll ignots[N][N]; //amount of ignots below the given point;
ll orbs[N][N]; //amount of orbs on the right
char tab[N][N];
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int rows, columns; cin >> rows >> columns;
ll sc = 0;
for(int y = 0; y < rows; y++){
for(int x = 0; x < columns; x++){
cin >> tab[x][y];
}
}
for(int y = rows-1; y >= 0; y--){
for(int x = columns-1; x >= 0; x--){
ignots[x][y] = ignots[x][y+1];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |