# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
381693 | peijar | Toll (BOI17_toll) | C++17 | 168 ms | 157164 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 int long long
using namespace std;
const int MAXN = 5e4;
const int MAXP = 16;
const int INF = 2e18;
int mod, nbSommets, nbAretes, nbRequetes;
int dis[MAXP][MAXN][5][5];
signed main(void)
{
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin >> mod >> nbSommets >> nbAretes >> nbRequetes;
for (int p(0); p < MAXP; ++p)
for (int iSommet(0); iSommet < MAXN; ++iSommet)
for (int iDep(0); iDep < mod; ++iDep)
for (int iFin(0); iFin < mod; ++iFin)
dis[p][iSommet][iDep][iFin] = INF;
while (nbAretes--)
{
int u, v, c;
cin >> u >> v >> c;
dis[0][u/mod][u%mod][v%mod] = c;
}
for (int p(1); p < MAXP; ++p)
for (int iSommet(0); iSommet + (1 << (p-1))< (nbSommets+mod-1)/mod; ++iSommet)
for (int iDep(0); iDep < mod; ++iDep)
# | 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... |