oj.uz

Submission #484938

# Submission time Handle Problem Language Result Execution time Memory
484938 2021-11-05T18:41:36 Z Olympia Tracks in the Snow (BOI13_tracks) C++17
82.5 / 100
 2000 ms 45336 KB 
#include <vector>
#include <iostream>
#include <cassert>
#include <cmath>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <algorithm>
#include <iomanip>

using namespace std;
vector<vector<bool>> hasVisited;
vector<string> grid;
vector<pair<int, int>> pos = {{0,  1},
                              {-1, 0},
                              {0,  -1},
                              {1,  0}};

int main() {
    //freopen("milkorder.in", "r", stdin);
    //freopen("milkorder.out", "w", stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n, m;
    cin >> n >> m;
    priority_queue<pair<int, pair<int, int>>> q;
    grid.resize(n), hasVisited.resize(n);
    for (int i = 0; i < n; i++) {
        cin >> grid[i];
        hasVisited[i].resize(m);
        for (int j = 0; j < m; j++) {
            hasVisited[i][j] = false;
        }
    }
    q.push({0, {0, 0}});
    int myMax = 0;
    while (!q.empty()) {
        pair<int, int> loc = q.top().second;
        int dist = -q.top().first;
        myMax = max(myMax, dist);
        q.pop();
        if (hasVisited[loc.first][loc.second]) {
            continue;
        }
        hasVisited[loc.first][loc.second] = true;
        for (auto p: pos) {
            int nx = loc.first + p.first;
            int ny = loc.second + p.second;
            if (nx >= 0 && ny >= 0 && nx < n && ny < m && grid[nx][ny] != '.') {
                if (hasVisited[nx][ny]) {
                    myMax = max(myMax, dist + (grid[nx][ny] != grid[loc.first][loc.second]));
                    continue;
                }
                q.push(make_pair(-dist - (grid[nx][ny] != grid[loc.first][loc.second]),
                                 make_pair(nx, ny)));
            }
        }
    }
    cout << myMax;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 908 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 50 ms 1424 KB Output is correct
5 Correct 5 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 6 ms 332 KB Output is correct
11 Correct 14 ms 552 KB Output is correct
12 Correct 28 ms 588 KB Output is correct
13 Correct 4 ms 332 KB Output is correct
14 Correct 4 ms 332 KB Output is correct
15 Correct 57 ms 800 KB Output is correct
16 Correct 84 ms 940 KB Output is correct
17 Correct 26 ms 588 KB Output is correct
18 Correct 53 ms 1344 KB Output is correct

Subtask #2
52.5 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 588 KB Output is correct
2 Correct 189 ms 2324 KB Output is correct
3 Correct 482 ms 20464 KB Output is correct
4 Correct 112 ms 4940 KB Output is correct
5 Correct 150 ms 11448 KB Output is correct
6 Execution timed out 2097 ms 45160 KB Time limit exceeded
7 Correct 1 ms 716 KB Output is correct
8 Correct 2 ms 716 KB Output is correct
9 Correct 7 ms 460 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 716 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 161 ms 2252 KB Output is correct
14 Correct 93 ms 1484 KB Output is correct
15 Correct 13 ms 1568 KB Output is correct
16 Correct 93 ms 1184 KB Output is correct
17 Correct 411 ms 5540 KB Output is correct
18 Correct 52 ms 5212 KB Output is correct
19 Correct 114 ms 4944 KB Output is correct
20 Correct 120 ms 4524 KB Output is correct
21 Correct 277 ms 11716 KB Output is correct
22 Correct 147 ms 11448 KB Output is correct
23 Correct 845 ms 10180 KB Output is correct
24 Correct 114 ms 11612 KB Output is correct
25 Correct 281 ms 20464 KB Output is correct
26 Execution timed out 2093 ms 15684 KB Time limit exceeded
27 Execution timed out 2086 ms 23640 KB Time limit exceeded
28 Execution timed out 2096 ms 45336 KB Time limit exceeded
29 Execution timed out 2085 ms 45260 KB Time limit exceeded
30 Execution timed out 2086 ms 44828 KB Time limit exceeded
31 Execution timed out 2100 ms 14620 KB Time limit exceeded
32 Execution timed out 2090 ms 22084 KB Time limit exceeded