답안 #1000558

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1000558 2024-06-17T17:44:45 Z yeediot 바이러스 (JOI19_virus) C++17
0 / 100
2 ms 860 KB
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
#ifdef local
void CHECK();
void setio(){
    freopen("/Users/iantsai/cpp/input.txt","r",stdin);
    freopen("/Users/iantsai/cpp/output.txt","w",stdout);
}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
#define TOI_is_so_de ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);setio();
const int mxn = 1e5+5, inf = 1e18, mxc = 805;
char w[mxn];
int t, n, m, mxw = 0, mxe = 0, v[mxc][mxc], st[10][mxc][mxc];
int get(int i, int l, int r){
    int k = __lg(r-l+1);
    return max(st[k][i][l], st[k][i][r-(1<<k)+1]);
}
signed main(){
    TOI_is_so_de;
    cin >> t >> n >> m;
    for(int i=1;i<=t;i++){
        cin >> w[i];
        w[i+t] = w[i];
    }
    int cnt = 0;
    for(int i=1;i<=2*t;i++){
        if(w[i] == w[i-1]){
            cnt++;
        }
        else{
            cnt = 1;
        }
        if(w[i] == 'W'){
            chmax(mxw, cnt);
        }
        else{
            chmax(mxe, cnt);
        }
    }
    if(mxw == 2*t) mxw = inf;
    if(mxe == 2*t) mxe = inf;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            cin >> v[i][j];
            if(v[i][j] == 0) v[i][j] = inf;
            st[0][i][j] = v[i][j];
        }
    }
    for(int i=1;i<10;i++){
        for(int j=1;j<=n;j++){
            for(int k=1;k+(1<<i)-1<=n;k++){
                st[i][j][k] = max(st[i-1][j][k], st[i-1][j][k+(1 << i-1)]);
            }
        }
    }
    int best = inf;
    cnt = 0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            if(v[i][j] == inf) continue;
            int ll = 1, lr = j, rl = j, rr = m;
            while(ll < lr){
                int mm = ll + lr >> 1;
                if(get(i, mm, j-1) > mxe){
                    ll = mm+1;
                }
                else{
                    lr = mm;
                }
            }
            while(rl < rr){
                int mm = rl + rr + 1 >> 1;
                if(get(i, j+1, mm) > mxw){
                    rr = mm-1;
                }
                else{
                    rl = mm;
                }
            }
            debug(i, j, ll, rl);
            if(rl-ll+1 < best){
                best = rl-ll+1;
                cnt = 1;
            }
            else if(rl-ll+1 == best){
                cnt++;
            }
        }
    }
    cout << best << '\n' << cnt << '\n';
    #ifdef local
    CHECK();
    #endif
}
/*
input:
 
*/
#ifdef local
void CHECK(){
    cerr << "\n[Time]: " << 1000.0 * clock() / CLOCKS_PER_SEC << " ms.\n";
     function<bool(string,string)> compareFiles = [](string p1, string p2)->bool {
         std::ifstream file1(p1);
         std::ifstream file2(p2);
         if (!file1.is_open() || !file2.is_open())return false;
         std::string line1, line2;
         while (getline(file1, line1) && getline(file2, line2)) {
             if (line1 != line2)return false;
         }
         int cnta=0,cntb=0;
         while(getline(file1,line1))cnta++;
         while(getline(file2,line2))cntb++;
         return cntb-cnta<=1;
     };
     bool check = compareFiles("output.txt","expected.txt");
     if (check) cerr<<"ACCEPTED\n";
     else cerr<<"WRONG ANSWER!\n";
}
#else
#endif



 

Compilation message

virus.cpp: In function 'int main()':
virus.cpp:91:70: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   91 |                 st[i][j][k] = max(st[i-1][j][k], st[i-1][j][k+(1 << i-1)]);
      |                                                                     ~^~
virus.cpp:102:29: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  102 |                 int mm = ll + lr >> 1;
      |                          ~~~^~~~
virus.cpp:111:34: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  111 |                 int mm = rl + rr + 1 >> 1;
      |                          ~~~~~~~~^~~
virus.cpp: In function 'void setIO(std::string)':
virus.cpp:35:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
virus.cpp:36:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 860 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 604 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 860 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -