Submission #1281455

#TimeUsernameProblemLanguageResultExecution timeMemory
1281455tuongllMosaic (IOI24_mosaic)C++20
12 / 100
1175 ms2162688 KiB
#include <bits/stdc++.h> using namespace std; int add(int a, int b){ return a == 0 && b == 0; } vector<long long> mosaic(vector<int> X, vector<int> Y, vector<int> T, vector<int> B, vector<int> L, vector<int> R){ int n = X.size(), q = T.size(); vector<vector<int>> grid(n, vector<int>(n)); for (int i = 0; i < n; ++i) grid[0][i] = X[i]; for (int j = 0; j < n; ++j) grid[j][0] = Y[j]; for (int i = 1; i < n; ++i){ for (int j = 1; j < n; ++j) grid[i][j] = add(grid[i - 1][j], grid[i][j - 1]); } vector<long long> ans(q); for (int i = 0; i < q; ++i){ for (int x = T[i]; x <= B[i]; ++x){ for (int y = L[i]; y <= R[i]; ++y) ans[i] += grid[x][y]; } } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...