oj.uz

Submission #301048

# Submission time Handle Problem Language Result Execution time Memory
301048 2020-09-17T16:01:37 Z zecookiez Computer Network (BOI14_network) C++17
100 / 100
 130 ms 11896 KB 
#include <bits/stdc++.h>
#include <network.h>
using namespace std;
template<class C>constexpr int len(const C&c){return int(c.size());}
 
const int MAXN = 1001;
vector<int> dist[MAXN];
int memo[MAXN][MAXN];

int pong(int a, int b){
    if(memo[a][b] != -1) return memo[a][b];
    return memo[a][b] = memo[b][a] = ping(a, b);
}

void findRoute(int N, int a, int b){
    memset(memo, -1, sizeof(memo));
    int c = pong(a, b); dist[c].push_back(b);
    for(int v, i = 1; i <= N; ++i){
        if(i == a) continue;
        v = pong(a, i);
        if(v < c) dist[v].push_back(i);
    }
    vector<int> ans = {b};
    for(int x = c - 1; x >= 0; --x){
        for(int nxt : dist[x]){
            if(pong(ans.back(), nxt) == 0){
                ans.push_back(nxt);
                break;
            }
        }
    }
    reverse(ans.begin(), ans.end());
    for(int i : ans) travelTo(i);
}

Compilation message

grader.c: In function 'int main()':
grader.c:48:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   48 |     scanf ("%d%d%d%d", &N, &a, &b, &M);
      |     ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
grader.c:51:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   51 |             scanf("%d", &distance[u][v]);
      |             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 8184 KB Output is correct
2 Correct 122 ms 8184 KB Output is correct
3 Correct 111 ms 8312 KB Output is correct
4 Correct 118 ms 8312 KB Output is correct
5 Correct 110 ms 8268 KB Output is correct
6 Correct 115 ms 8184 KB Output is correct
7 Correct 3 ms 4224 KB Output is correct
8 Correct 3 ms 4352 KB Output is correct
9 Correct 3 ms 4224 KB Output is correct
10 Correct 3 ms 4352 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 8264 KB Output is correct
2 Correct 30 ms 6264 KB Output is correct
3 Correct 122 ms 8184 KB Output is correct
4 Correct 106 ms 8196 KB Output is correct
5 Correct 122 ms 8200 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 117 ms 8160 KB Output is correct
2 Correct 30 ms 6272 KB Output is correct
3 Correct 130 ms 8184 KB Output is correct
4 Correct 107 ms 8184 KB Output is correct
5 Correct 128 ms 8312 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 118 ms 8184 KB Output is correct
2 Correct 32 ms 6264 KB Output is correct
3 Correct 125 ms 8184 KB Output is correct
4 Correct 111 ms 10232 KB Output is correct
5 Correct 127 ms 11896 KB Output is correct