oj.uz

답안 #854640

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
854640 2023-09-28T09:39:06 Z efedmrlr Selotejp (COCI20_selotejp) C++17
70 / 110
 1000 ms 564 KB 
#include <bits/stdc++.h>

using namespace std;

#define n_l '\n'
#define dbg(...) cout << "[" << #__VA_ARGS__ << "]: "; cout << to_string(__VA_ARGS__) << endl
template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)),  __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); } 
#define dbgm(...) cout << "[" << #__VA_ARGS__ << "]: "; dbgm(__VA_ARGS__); cout << endl


#define int long long int
#define MP make_pair
#define pb push_back
#define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}


const double EPS = 0.00001;
const int INF = 1e9+500;
const int N = 1e3+5;
const int M = 11;
const int ALPH = 26;
const int LGN = 25;
const int MOD = 1e9+7;
int n,m,q;
vector<int> dp, dpnew;
vector<vector<int> > grid;
inline void solve() {
    cin>>n>>m;
    dp.assign((1<<m) , INF);
    dpnew.assign((1<<m), INF);
    grid.resize(n, vector<int> (m));
    for(int i = 0; i<n; i++) {
        for(int j = 0; j<m; j++) {
            char tmp;
            cin>>tmp;
            grid[i][j] = (tmp == '#') ? 0 : 1;
        }
    }
    dp[0] = 0;
    for(int i = 0; i<n; i++) {
        for(int mask = 0; mask < (1<<m); mask++) {
            bool flag = 0;
            for(int j = 0; j<m; j++) {
                
                if(grid[i][j] && (mask & (1<<j)) ) {
                    dpnew[mask] = INF;
                    flag = 1;
                    break;
                }
                

            }
            if(flag) continue;
            for(int lm = 0; lm < (1<<m); lm++) {
                if(dp[lm] == INF) continue;
                int cnt = 0;
                vector<int> walls = grid[i];
                for(int j = 0; j<m; j++){
                    if((mask & (1<<j)) && !(lm & (1<<j)) ) {
                        
                        cnt++;
                        walls[j] = 1;
                    } 
                    else if( (mask & (1<<j)) && (lm & (1<<j)) ) {
                        walls[j] = 1;
                    }

                }
                int last = -1;

                for(int j = 0; j<m; j++) {
                    if(walls[j]) {

                        if(j > last + 1) {
                            cnt++;
                            
                        }
                        last = j;
                    }

                }
                if(last != m-1) {
                    cnt++;
                }
                dpnew[mask] = min(dpnew[mask] , cnt + dp[lm]);
            }
        }
        dp = dpnew;
        dpnew.assign((1<<m), INF);
    }
    int ans = INF;
    for(int i = 0; i<(1<<m); i++) ans = min(ans, dp[i]);
    cout<<ans<<"\n";

}
 
signed main() {
    //freopen("milkvisits.in", "r", stdin);
    //freopen("milkvisits.out", "w", stdout);
    //fastio();
    int test = 1;
    //cin>>test;
    while(test--) {
        solve();
    }
    
}

Compilation message

Main.cpp: In function 'std::string to_string(std::string, int, int)':
Main.cpp:7:208: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)),  __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); }
      |                                                                                                                                                                                                             ~~~^~~~~~~~~~

Subtask #1
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 27 ms 348 KB Output is correct
3 Correct 14 ms 344 KB Output is correct
4 Correct 20 ms 348 KB Output is correct
5 Correct 40 ms 348 KB Output is correct
6 Correct 50 ms 344 KB Output is correct
7 Correct 46 ms 348 KB Output is correct
8 Correct 9 ms 348 KB Output is correct
9 Correct 22 ms 564 KB Output is correct
10 Correct 417 ms 344 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 20 ms 348 KB Output is correct
3 Correct 0 ms 360 KB Output is correct
4 Correct 48 ms 452 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 10 ms 436 KB Output is correct
8 Correct 13 ms 348 KB Output is correct

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 27 ms 348 KB Output is correct
3 Correct 14 ms 344 KB Output is correct
4 Correct 20 ms 348 KB Output is correct
5 Correct 40 ms 348 KB Output is correct
6 Correct 50 ms 344 KB Output is correct
7 Correct 46 ms 348 KB Output is correct
8 Correct 9 ms 348 KB Output is correct
9 Correct 22 ms 564 KB Output is correct
10 Correct 417 ms 344 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 20 ms 348 KB Output is correct
13 Correct 0 ms 360 KB Output is correct
14 Correct 48 ms 452 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 10 ms 436 KB Output is correct
18 Correct 13 ms 348 KB Output is correct
19 Correct 4 ms 348 KB Output is correct
20 Correct 36 ms 548 KB Output is correct
21 Correct 83 ms 528 KB Output is correct
22 Correct 6 ms 348 KB Output is correct
23 Correct 7 ms 344 KB Output is correct
24 Correct 17 ms 348 KB Output is correct
25 Correct 214 ms 348 KB Output is correct
26 Execution timed out 1055 ms 344 KB Time limit exceeded
27 Halted 0 ms 0 KB -