oj.uz

답안 #1091845

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1091845 2024-09-22T10:30:00 Z Jakub_Wozniak Tracks in the Snow (BOI13_tracks) C++14
91.25 / 100
 2000 ms 64176 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;
    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-i*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:58: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]
   58 |         for(int k = 0 ; k < R.size() ; k++)
      |                         ~~^~~~~~~~~~

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 2908 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 15 ms 3164 KB Output is correct
5 Correct 3 ms 1884 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 0 ms 860 KB Output is correct
10 Correct 3 ms 1628 KB Output is correct
11 Correct 4 ms 1372 KB Output is correct
12 Correct 10 ms 1976 KB Output is correct
13 Correct 3 ms 1896 KB Output is correct
14 Correct 3 ms 1884 KB Output is correct
15 Correct 22 ms 3112 KB Output is correct
16 Correct 28 ms 2908 KB Output is correct
17 Correct 14 ms 2972 KB Output is correct
18 Correct 17 ms 3160 KB Output is correct

Subtask #2
61.25 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 15452 KB Output is correct
2 Correct 78 ms 8540 KB Output is correct
3 Correct 227 ms 47444 KB Output is correct
4 Correct 86 ms 15196 KB Output is correct
5 Correct 133 ms 29800 KB Output is correct
6 Execution timed out 2053 ms 64092 KB Time limit exceeded
7 Correct 8 ms 16220 KB Output is correct
8 Correct 7 ms 15548 KB Output is correct
9 Correct 3 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 7 ms 15708 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 77 ms 8592 KB Output is correct
14 Correct 46 ms 5724 KB Output is correct
15 Correct 14 ms 6236 KB Output is correct
16 Correct 37 ms 3416 KB Output is correct
17 Correct 205 ms 16476 KB Output is correct
18 Correct 51 ms 16220 KB Output is correct
19 Correct 87 ms 15196 KB Output is correct
20 Correct 64 ms 14212 KB Output is correct
21 Correct 143 ms 30812 KB Output is correct
22 Correct 131 ms 29784 KB Output is correct
23 Correct 406 ms 25432 KB Output is correct
24 Correct 103 ms 30556 KB Output is correct
25 Correct 228 ms 47444 KB Output is correct
26 Correct 951 ms 38228 KB Output is correct
27 Correct 1597 ms 49604 KB Output is correct
28 Execution timed out 2068 ms 64176 KB Time limit exceeded
29 Execution timed out 2057 ms 55744 KB Time limit exceeded
30 Execution timed out 2024 ms 54992 KB Time limit exceeded
31 Correct 1309 ms 33628 KB Output is correct
32 Correct 1231 ms 48736 KB Output is correct