oj.uz

답안 #1091849

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1091849 2024-09-22T10:31:24 Z Jakub_Wozniak Tracks in the Snow (BOI13_tracks) C++14
93.4375 / 100
 2000 ms 76776 KB 
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
const int maxn = 4003;
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);
    cout.tie(0);
    cin >> N >> M;
    int i , j , k;
    for(i = 0 ; i <= M+1 ; i++)SA.push_back('.');
    s[0] = SA;
    s[N+1] = SA;


    pr();
    for(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});
    
    vis[1][1] = 1;

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

        for(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:59:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |         for(k = 0 ; k < R.size() ; k++)
      |                     ~~^~~~~~~~~~

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 3164 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 18 ms 3304 KB Output is correct
5 Correct 4 ms 1884 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 860 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 4 ms 1624 KB Output is correct
11 Correct 4 ms 1528 KB Output is correct
12 Correct 10 ms 1884 KB Output is correct
13 Correct 4 ms 1884 KB Output is correct
14 Correct 4 ms 1984 KB Output is correct
15 Correct 22 ms 3164 KB Output is correct
16 Correct 32 ms 3164 KB Output is correct
17 Correct 15 ms 3164 KB Output is correct
18 Correct 18 ms 3288 KB Output is correct

Subtask #2
63.4375 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 15452 KB Output is correct
2 Correct 78 ms 10076 KB Output is correct
3 Correct 248 ms 60248 KB Output is correct
4 Correct 84 ms 18516 KB Output is correct
5 Correct 148 ms 37392 KB Output is correct
6 Execution timed out 2023 ms 76576 KB Time limit exceeded
7 Correct 7 ms 16220 KB Output is correct
8 Correct 10 ms 15452 KB Output is correct
9 Correct 3 ms 860 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 7 ms 15964 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 76 ms 10208 KB Output is correct
14 Correct 41 ms 6748 KB Output is correct
15 Correct 12 ms 7256 KB Output is correct
16 Correct 36 ms 3928 KB Output is correct
17 Correct 195 ms 20048 KB Output is correct
18 Correct 45 ms 20052 KB Output is correct
19 Correct 78 ms 18708 KB Output is correct
20 Correct 56 ms 17244 KB Output is correct
21 Correct 138 ms 38564 KB Output is correct
22 Correct 129 ms 37456 KB Output is correct
23 Correct 389 ms 32148 KB Output is correct
24 Correct 106 ms 38008 KB Output is correct
25 Correct 241 ms 59984 KB Output is correct
26 Correct 962 ms 47952 KB Output is correct
27 Correct 1592 ms 62284 KB Output is correct
28 Execution timed out 2093 ms 76776 KB Time limit exceeded
29 Execution timed out 2093 ms 68408 KB Time limit exceeded
30 Correct 1993 ms 66904 KB Output is correct
31 Correct 1339 ms 41684 KB Output is correct
32 Correct 1239 ms 61052 KB Output is correct