oj.uz

Submission #826375

# Submission time Handle Problem Language Result Execution time Memory
826375 2023-08-15T13:39:28 Z ajay Pohlepko (COCI16_pohlepko) C++14
80 / 80
 12 ms 8352 KB 
/* Ajay Jadhav */

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <deque>
#include <vector>
#include <cstdlib>
#include <iomanip>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <ctime>
#include <string.h>
#include <climits>
#include <cstring>
using namespace std;

#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vvi vector<vi>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define x first
#define y second
#define sz(x) (int)x.size()
#define hell 1000000007
#define rep(i, a, b) for (int i = a; i < b; i++)
#define endl '\n'

typedef pair<int, int> point;

void solve()
{
    const int MAX = 2010;
    int n, m;
    char grid[MAX][MAX];
    bool vis[MAX][MAX];
    cin >> n >> m;
    for (int i = 0; i < n; ++i)
        cin >> grid[i];
    vector<point> curr, next;
    for (curr.push_back({0, 0}); !curr.empty(); curr = next)
    {
        point p = curr.back();
        cout << grid[p.x][p.y];

        char mn = 'z';
        for (point pt : curr)
        {
            int dx = 1, dy = 0;
            for (int i = 0; i < 2; ++i)
            {
                swap(dx, dy);
                int nx = pt.x + dx;
                int ny = pt.y + dy;
                if (nx >= n || ny >= m)
                    continue;
                mn = min(mn, grid[nx][ny]);
            }
        }

        next.clear();
        for (point pt : curr)
        {
            int dx = 1, dy = 0;
            for (int i = 0; i < 2; ++i)
            {
                swap(dx, dy);
                int nx = pt.x + dx;
                int ny = pt.y + dy;
                if (nx >= n || ny >= m)
                    continue;
                if (vis[nx][ny])
                    continue;
                if (grid[nx][ny] == mn)
                {
                    next.push_back({nx, ny});
                    vis[nx][ny] = 1;
                }
            }
        }
    }

    cout << endl;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    // cin>>t;
    while (t--)
    {
        solve();
    }
    return 0;
}

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8148 KB Output is correct
2 Correct 3 ms 8148 KB Output is correct
3 Correct 3 ms 8220 KB Output is correct
4 Correct 3 ms 8220 KB Output is correct
5 Correct 3 ms 8148 KB Output is correct
6 Correct 4 ms 8276 KB Output is correct
7 Correct 5 ms 8276 KB Output is correct
8 Correct 7 ms 8232 KB Output is correct
9 Correct 3 ms 8228 KB Output is correct
10 Correct 4 ms 8276 KB Output is correct
11 Correct 4 ms 8332 KB Output is correct
12 Correct 4 ms 8232 KB Output is correct
13 Correct 4 ms 8332 KB Output is correct
14 Correct 6 ms 8236 KB Output is correct
15 Correct 4 ms 8148 KB Output is correct
16 Correct 12 ms 8352 KB Output is correct