# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
553119 | Talha_Taki | Toll (BOI17_toll) | C++17 | 234 ms | 23336 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 ll;
typedef pair <int, int> pii;
int main(const int argc, const char *argv[]) {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
const int INF = 1e9;
int k, n, m, o, group;
cin >> k >> n >> m >> o;
group = n/k;
vector <int> lg(group+1);
lg[1] = 0;
for(int i = 2; i <= group; ++i) {
lg[i] = lg[i>>1] + 1;
}
vector <vector <vector <vector <int>>>> dp(group+1, vector <vector <vector <int>>> (k, vector <vector <int>> (k, vector <int> (lg[group]+1, INF))));
for(int i = 0; i < m; ++i) {
int a, b, w;
cin >> a >> b >> w;
dp[a/k][a%k][b%k][0] = w;
# | 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... |