oj.uz

Submission #1091833

# Submission time Handle Problem Language Result Execution time Memory
1091833 2024-09-22T10:16:25 Z Jakub_Wozniak Tracks in the Snow (BOI13_tracks) C++14
93.4375 / 100
 2000 ms 76740 KB 
#include <bits/stdc++.h>
using namespace std;
const int maxn = 4009;
typedef long long ll;
int N , M;
string s[maxn];
string SA;
int a , b , c;
vector <pair<int,int>> R;
bool vis[maxn][maxn];
int MAXI = 0;

void pr()
{
    R.push_back({-1,0});
    R.push_back({1,0});
    R.push_back({0,1});
    R.push_back({0,-1});
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> N >> M;
    for(int i = 0 ; i <= M+1 ; i++)SA.push_back( '.');
    s[0] = SA;
    s[N+1] = SA;


    pr();
    for(int i = 1 ; i <= N  ;i++)
    {
        cin >> SA;
        s[i] = '.';
        s[i] += SA;
        s[i].push_back('.');
    }

    priority_queue <pair<int,int>> q;
    pair<int,int> DS;
    q.push({-1,1*maxn+1});
    int i , j;
    vis[1][1] = 1;

    while(!q.empty())
    {
        DS = q.top();
        c = -DS.first; 
        i = DS.second/maxn;
        j = DS.second%maxn;
        q.pop();
        
        MAXI = max(MAXI , c);

        for(int k = 0 ; k < R.size() ; k++)
        {
            a = i+R[k].first;
            b = j+R[k].second;
            if(s[a][b] == '.' || vis[a][b])continue;
            vis[a][b] = 1;
            if(s[a][b] == s[i][j]){ q.push({-c,a*maxn+b});}
            else {q.push({-(c+1),a*maxn+b});}
        }
    }

    cout << MAXI << '\n';


    return 0;
}

Compilation message

tracks.cpp: In function 'int main()':
tracks.cpp:56:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |         for(int k = 0 ; k < R.size() ; k++)
      |                         ~~^~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 3164 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 18 ms 3300 KB Output is correct
5 Correct 3 ms 1884 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 860 KB Output is correct
9 Correct 1 ms 848 KB Output is correct
10 Correct 3 ms 1628 KB Output is correct
11 Correct 4 ms 1372 KB Output is correct
12 Correct 11 ms 2064 KB Output is correct
13 Correct 3 ms 1884 KB Output is correct
14 Correct 4 ms 1884 KB Output is correct
15 Correct 22 ms 3364 KB Output is correct
16 Correct 28 ms 3164 KB Output is correct
17 Correct 15 ms 3164 KB Output is correct
18 Correct 20 ms 3164 KB Output is correct

Subtask #2
63.4375 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 15452 KB Output is correct
2 Correct 74 ms 10148 KB Output is correct
3 Correct 242 ms 59992 KB Output is correct
4 Correct 87 ms 18524 KB Output is correct
5 Correct 133 ms 36980 KB Output is correct
6 Execution timed out 2007 ms 76740 KB Time limit exceeded
7 Correct 6 ms 16220 KB Output is correct
8 Correct 6 ms 15452 KB Output is correct
9 Correct 3 ms 900 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 6 ms 15964 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 72 ms 10132 KB Output is correct
14 Correct 46 ms 7000 KB Output is correct
15 Correct 11 ms 7260 KB Output is correct
16 Correct 36 ms 3928 KB Output is correct
17 Correct 212 ms 20052 KB Output is correct
18 Correct 44 ms 19804 KB Output is correct
19 Correct 85 ms 18508 KB Output is correct
20 Correct 64 ms 16988 KB Output is correct
21 Correct 133 ms 38404 KB Output is correct
22 Correct 124 ms 37116 KB Output is correct
23 Correct 410 ms 31828 KB Output is correct
24 Correct 104 ms 37988 KB Output is correct
25 Correct 213 ms 59824 KB Output is correct
26 Correct 982 ms 48024 KB Output is correct
27 Correct 1621 ms 62152 KB Output is correct
28 Execution timed out 2062 ms 76360 KB Time limit exceeded
29 Execution timed out 2036 ms 68332 KB Time limit exceeded
30 Correct 1969 ms 67256 KB Output is correct
31 Correct 1348 ms 39640 KB Output is correct
32 Correct 1208 ms 56780 KB Output is correct