# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
315593 | nafis_shifat | Toll (BOI17_toll) | C++14 | 499 ms | 21940 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 pii pair<int,int>
using namespace std;
const int mxn=5e4+5;
const ll inf=1e15;
vector<int> adj[mxn];
vector<int> tps[mxn];
int l[5 * mxn],r[5 * mxn],w[5 * mxn];
int k,m,n;
ll d[mxn][6][6];
ll res[mxn];
struct query {
int a,b;
int ind;
query(int x,int y,int z) : a(x),b(y),ind(z) {};
};
void solve(int b, int e, vector<query> q) {
if(q.size() == 0) return;
if(b == e) {
for(auto i : q) res[i.ind] = -1;
return;
}
int mid = b + e >> 1;
for(int i = 0; i < k; i++) {
for(int j = 0; j < k; j++) {
d[mid][i][j] = i == j ? 0 : inf;
}
}
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... |