oj.uz

Submission #222025

# Submission time Handle Problem Language Result Execution time Memory
222025 2020-04-11T22:18:23 Z Haunted_Cpp Pohlepko (COCI16_pohlepko) C++17
55 / 80
 73 ms 20960 KB 
/*
 author: Haunted_Cpp
 "Persistence guarantees that results are inevitable"
*/
 
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
 
#pragma GCC optimize ("Ofast")
#pragma GCC target("fma,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
 
using namespace std;
 
const int N = 2e3 + 5;

int step [N][N];
char g [N][N];
char dist [N];

const int dr [] = {+0, +1};
const int dc [] = {+1, +0};

int main () {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int r, c;
  cin >> r >> c;
  for (int i = 0; i < r; i++) {
    for (int j = 0; j < c; j++) {
      cin >> g[i][j];
      step[i][j] = -1;
    }
  }
  for (int i = 0; i < N; i++) dist[i] = 'z';
  const int K = r + c - 1;
  dist[0] = g[0][0];
  step[0][0] = 0;
  queue<pair<int, int> > q;
  q.push({0, 0});
  while (!q.empty()) {
    int linha = q.front().first;
    int coluna = q.front().second;
    q.pop();
    if (g[linha][coluna] != dist[step[linha][coluna]]) continue;
    for (int i = 0; i < 2; i++) {
      if (linha + dr[i] < 0 || linha + dr[i] >= r || coluna < 0 || coluna + dc[i] >= c) continue;
      if (step[linha + dr[i]][coluna + dc[i]] != -1) continue;
      step[linha + dr[i]][coluna + dc[i]] = step[linha][coluna] + 1;
      dist[step[linha + dr[i]][coluna + dc[i]]] = min (dist[step[linha + dr[i]][coluna + dc[i]]], g[linha + dr[i]][coluna + dc[i]]);
      q.push({linha + dr[i], coluna + dc[i]});
    }
  }
  for (int i = 0; i < K; i++) cout << dist[i];
  cout << '\n';
  return 0;
}

Subtask #1
55.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 6 ms 3328 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 640 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 9 ms 3584 KB Output is correct
7 Incorrect 31 ms 14464 KB Output isn't correct
8 Incorrect 71 ms 20928 KB Output isn't correct
9 Correct 5 ms 1024 KB Output is correct
10 Correct 6 ms 1792 KB Output is correct
11 Correct 7 ms 1664 KB Output is correct
12 Correct 13 ms 7936 KB Output is correct
13 Incorrect 13 ms 13312 KB Output isn't correct
14 Incorrect 73 ms 20960 KB Output isn't correct
15 Correct 5 ms 1024 KB Output is correct
16 Incorrect 44 ms 16120 KB Output isn't correct