Submission #1212955

#TimeUsernameProblemLanguageResultExecution timeMemory
1212955bangan메기 농장 (IOI22_fish)C++20
0 / 100
1098 ms112704 KiB
#include "fish.h" #include <bits/stdc++.h> using namespace std; using ll = long long; #define pb push_back #define all(a) a.begin(), a.end() const int maxn = 3030; int a[maxn][maxn]; int b[maxn][maxn]; int c[maxn]; ll pre[maxn][maxn]; ll get(int x, int l, int r) {return pre[x][r] - pre[x][l-1];} long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) { for (int i = 0; i < M; i++) pre[Y[i] + 1][X[i]] = W[i]; for (int x = 0; x < N; x++) for (int y = 1; y <= N; y++) pre[x][y] += pre[x][y-1]; return 0; }
#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...