# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
124562 | deinfreund | Orchard (NOI14_orchard) | C++14 | 605 ms | 166392 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;
int solve1D(vector<int> vals){
vector<int> sums(vals.size());
int totalTrees;
for (int x= 0; x < vals.size(); x++){
/*cin >> vals[x][y];
totalTrees[y] += vals[x][y];
vals[x][y] = 2 * vals[x][y] - 1;
if (x > 0) sums[x][y] += sums[x-1][y];
sums[x][y] += vals[x][y];*/
}
}
int main(){
int h, w;
cin >> h >> w;
vector<vector<int> > sums(w+1, vector<int>(h+1));
vector<vector<int>> totalTrees(w+1, vector<int>(h+1));
vector<vector<int> > vals(w+1, vector<int>(h+1));
h++;w++;
for (int y = 1; y< h; y++){
for (int x= 1; x < w; x++){
cin >> vals[x][y];
totalTrees[x][y] += vals[x][y];
totalTrees[x][y] += totalTrees[x-1][y];
vals[x][y] = 2 * vals[x][y] - 1;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |