oj.uz

Submission #890060

# Submission time Handle Problem Language Result Execution time Memory
890060 2023-12-20T13:28:35 Z Kutan Robots (APIO13_robots) C++14
10 / 100
 1 ms 604 KB 
// Cao Quang Hung
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>

using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<long long , long long>
#define vi vector<int>
#define vpii vector<pii>
#define SZ(x) ((int)(x.size()))
#define fi first
#define se second
#define IN(x,y) ((y).find((x))!=(y).end())
#define ALL(t) t.begin(),t.end()
#define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++)
#define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
#define REPD(i,a,b) for(int (i)=(a); (i)>=(b);--i)
#define FOR(i, n) for (int (i) = 0; (i) < (n); ++(i))
#define dem(x) __builtin_popcount(x)
#define Mask(x) (1LL << (x))
#define BIT(x, i) ((x) >> (i) & 1)
#define ln '\n'
#define io_faster ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
///mt19937 rnd(time(0));

const int INF = 1e9 , mod = 1e9 + 7;

template <class T1, class T2>
inline T1 mul(T1& x, const T2 &k){ return x = (1LL * x * k) % mod; }

template <class T1 , class T2>
inline T1 pw(T1 x, T2 k){T1 res = 1; for (; k ; k >>= 1){ if (k & 1) mul(res, x); mul(x, x); } return res;}

template <class T>
inline bool minimize(T &x, const T &y){ if (x > y){x = y; return 1;} return 0; }

template <class T>
inline bool maximize(T &x, const T &y){ if (x < y){x = y; return 1;} return 0; }

template <class T>
inline void add(T &x , const T &y){ if ((x += y) >= mod) x -= mod; }

template <class T>
inline T product (const T &x , const T &y) { return 1LL * x * y % mod; }

#define PROB "a"
void file(){
    if(fopen(PROB".inp", "r")){
        freopen(PROB".inp","r",stdin);
        freopen(PROB".out","w",stdout);
    }
}
void sinh_(){
//    srand(time(0));
//    freopen(PROB".inp" , "w" , stdout);
//    int n;
}

typedef long long ll;
typedef double db;
const int N = 5e2 + 5;

const int dx[] = {0, 0, -1, +1};
const int dy[] = {-1, 1, 0, 0};

int numRobot, n, m;
char a[N][N];

void readip(){
    cin >> numRobot >> m >> n;
    REP(i, 1, n) REP(j, 1, m) cin >> a[i][j];
}   

namespace sub1 {
    bool check() {
        if (n > 10 || m > 10 || numRobot > 2) return false;
        REP(i, 1, n) REP(j, 1, m) if (a[i][j] == 'A' || a[i][j] == 'C') return false;
        return 1;
    }   

    pii Move(int x, int y, int dir) {
        while(true) {
            int nx = x + dx[dir];
            int ny = y + dy[dir];
            if (nx < 1 || nx > n || ny < 1 || ny > m || a[nx][ny] == 'x')
                return {x, y};
            x = nx, y = ny;
        }
        return {-1, -1};
    }

    int Dist[2][15][15];
    void bfs(int t, int x, int y) {
        queue<pii> q;
        Dist[t][x][y] = 0;
        q.push({x, y});
        while(!q.empty()) {
            auto [x, y] = q.front(); q.pop();
            FOR(d, 4) {
                pii tmp = Move(x, y, d);
                if (Dist[t][tmp.first][tmp.second] == -1) {
                    Dist[t][tmp.first][tmp.second] = Dist[t][x][y] + 1;
                    q.push(tmp);
                }
            }
        }
    }

    void solve() {
        memset(Dist, -1, sizeof Dist);
        REP(i, 1, n) REP(j, 1, m) if (a[i][j] >= '1' && a[i][j] <= '9') 
            bfs(a[i][j] - '1', i, j);
        int res = 1e9;
        REP(i, 1, n) REP(j, 1, m) if (Dist[0][i][j] != -1 && Dist[1][i][j] != -1)
            minimize(res, Dist[0][i][j] + Dist[1][i][j]);
        if (res == 1e9) cout << "-1";
        else cout << res << ln;
    }       

};

void solve(){   
    if (sub1::check()) {
        sub1::solve();
        return;
    }

}

int main(){
    sinh_();
    io_faster
    file();
    int t = 1;
//    cin >> t;
    while (t--){
        readip();
        solve();
    }
}

Compilation message

robots.cpp: In function 'void readip()':
robots.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
robots.cpp:147:5: note: in expansion of macro 'REP'
  147 |     REP(i, 1, n) REP(j, 1, m) cin >> a[i][j];
      |     ^~~
robots.cpp:92:28: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
robots.cpp:147:18: note: in expansion of macro 'REP'
  147 |     REP(i, 1, n) REP(j, 1, m) cin >> a[i][j];
      |                  ^~~
robots.cpp: In function 'bool sub1::check()':
robots.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
robots.cpp:153:9: note: in expansion of macro 'REP'
  153 |         REP(i, 1, n) REP(j, 1, m) if (a[i][j] == 'A' || a[i][j] == 'C') return false;
      |         ^~~
robots.cpp:92:28: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
robots.cpp:153:22: note: in expansion of macro 'REP'
  153 |         REP(i, 1, n) REP(j, 1, m) if (a[i][j] == 'A' || a[i][j] == 'C') return false;
      |                      ^~~
robots.cpp: In function 'void sub1::bfs(int, int, int)':
robots.cpp:174:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  174 |             auto [x, y] = q.front(); q.pop();
      |                  ^
robots.cpp:94:28: warning: unnecessary parentheses in declaration of 'd' [-Wparentheses]
   94 | #define FOR(i, n) for (int (i) = 0; (i) < (n); ++(i))
      |                            ^
robots.cpp:175:13: note: in expansion of macro 'FOR'
  175 |             FOR(d, 4) {
      |             ^~~
robots.cpp: In function 'void sub1::solve()':
robots.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
robots.cpp:187:9: note: in expansion of macro 'REP'
  187 |         REP(i, 1, n) REP(j, 1, m) if (a[i][j] >= '1' && a[i][j] <= '9')
      |         ^~~
robots.cpp:92:28: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
robots.cpp:187:22: note: in expansion of macro 'REP'
  187 |         REP(i, 1, n) REP(j, 1, m) if (a[i][j] >= '1' && a[i][j] <= '9')
      |                      ^~~
robots.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
robots.cpp:190:9: note: in expansion of macro 'REP'
  190 |         REP(i, 1, n) REP(j, 1, m) if (Dist[0][i][j] != -1 && Dist[1][i][j] != -1)
      |         ^~~
robots.cpp:92:28: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
robots.cpp:190:22: note: in expansion of macro 'REP'
  190 |         REP(i, 1, n) REP(j, 1, m) if (Dist[0][i][j] != -1 && Dist[1][i][j] != -1)
      |                      ^~~
robots.cpp: In function 'void file()':
robots.cpp:125:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  125 |         freopen(PROB".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
robots.cpp:126:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  126 |         freopen(PROB".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 464 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 464 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 464 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 464 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -