Submission #936147

#	Time	Username	Problem	Language	Result	Execution time	Memory
936147		vjudge1	Global Warming (CEOI18_glo)	C++17	0 / 100	2039 ms	91240 KiB

glo

// 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 = 2e5 + 5;
 
#define matrix vector<vector<int>> 
 
map<matrix, int> dist;
matrix s, t;
void readip(){
    t.assign(3, vi(3, 0));
    s.assign(3, vi(3, 0));
    int cnt = 0;
    FOR(i, 3) FOR(j, 3) {
        cin >> s[i][j];
        t[i][j] = ++cnt;
    }
}
 
queue<matrix> q;
void solve(){   
    dist[s] = 0;
    q.push(s);  
 
    while(!q.empty()) {
        auto u = q.front(); q.pop();
        int du = dist[u];
 
        if (u == t) {
            cout << du << ln;
            return;
        }
 
        FOR(i, 2) FOR(j, 3) {
            swap(u[i][j], u[i+1][j]);   
            
            if (dist.find(u) == dist.end()) {
                dist[u] = du + 1;
                q.push(u);
            }
 
            swap(u[i][j], u[i+1][j]);
        }
 
 
        FOR(i, 3) FOR(j, 2) {
            swap(u[i][j], u[i][j+1]);
            if (dist.find(u) == dist.end()) {
                dist[u] = du + 1;
                q.push(u);
            }
            swap(u[i][j], u[i][j+1]);
        }
    }
}
 
int main(){
    sinh_();
    io_faster
    file();
    int t = 1;
//    cin >> t;
    while (t--){
        readip();
        solve();
    }
}

Compilation message (stderr)

glo.cpp: In function 'void readip()':
glo.cpp:94:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   94 | #define FOR(i, n) for (int (i) = 0; (i) < (n); ++(i))
      |                            ^
glo.cpp:147:5: note: in expansion of macro 'FOR'
  147 |     FOR(i, 3) FOR(j, 3) {
      |     ^~~
glo.cpp:94:28: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   94 | #define FOR(i, n) for (int (i) = 0; (i) < (n); ++(i))
      |                            ^
glo.cpp:147:15: note: in expansion of macro 'FOR'
  147 |     FOR(i, 3) FOR(j, 3) {
      |               ^~~
glo.cpp: In function 'void solve()':
glo.cpp:94:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   94 | #define FOR(i, n) for (int (i) = 0; (i) < (n); ++(i))
      |                            ^
glo.cpp:167:9: note: in expansion of macro 'FOR'
  167 |         FOR(i, 2) FOR(j, 3) {
      |         ^~~
glo.cpp:94:28: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   94 | #define FOR(i, n) for (int (i) = 0; (i) < (n); ++(i))
      |                            ^
glo.cpp:167:19: note: in expansion of macro 'FOR'
  167 |         FOR(i, 2) FOR(j, 3) {
      |                   ^~~
glo.cpp:94:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   94 | #define FOR(i, n) for (int (i) = 0; (i) < (n); ++(i))
      |                            ^
glo.cpp:179:9: note: in expansion of macro 'FOR'
  179 |         FOR(i, 3) FOR(j, 2) {
      |         ^~~
glo.cpp:94:28: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   94 | #define FOR(i, n) for (int (i) = 0; (i) < (n); ++(i))
      |                            ^
glo.cpp:179:19: note: in expansion of macro 'FOR'
  179 |         FOR(i, 3) FOR(j, 2) {
      |                   ^~~
glo.cpp: In function 'void file()':
glo.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);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
glo.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: 0 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 13
• Subtask 4: 0 / 10
• Subtask 5: 0 / 20
• Subtask 6: 0 / 17
• Subtask 7: 0 / 25