oj.uz

답안 #774217

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
774217 2023-07-05T13:08:01 Z Sam_a17 바이러스 (JOI19_virus) C++17
14 / 100
 317 ms 3424 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
 
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
 
#define sz(x) (int)x.size()
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt __builtin_popcount
 
#define pb push_back
#define popf pop_front
#define popb pop_back
#define ld long double
#define ll long long
 
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// Indexed Set  
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
// template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(Tree <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
 
 
// for random generations
mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
// mt19937 myrand(131);
 
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
 
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();
 
  // if(str == "input") {
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
  // } else if(str != "") {
    // freopen((str + ".in").c_str(), "r", stdin);
    // freopen((str + ".out").c_str(), "w", stdout);
  // }
}
 
const int inf = 1e9;
const int N = 905;
int a[N][N];
int m, r, c;
 
void solve_() {
  cin >> m >> r >> c;
  string s; cin >> s;
  s = s + s;

  set<char> st;
  int flag = 1;
  for(auto i: s) {
    st.insert(i);
  }
 
  for(int i = 1; i <= r; i++) {
    for(int j = 1; j <= c; j++) {
      cin >> a[i][j];
    }
  }
    
  int max_w = 0, max_e = 0;

  if(sz(st) == 1) {
    if(*st.begin() == 'W') {
      max_w = inf;
    } else {
      assert(*st.begin() == 'E');
      max_e = inf;
    }
  } else {
    m = sz(s);

    for(int i = 0; i < m; i++) {
      int j = i, cnt = 0;
      while(j < m && s[j] == s[i]) {
        j++, cnt++;
      }
      if(s[i] == 'W') max_w = max(max_w, cnt);
      else max_e = max(max_e, cnt);
      i = j - 1;
    }
  }

  pair<int, int> answ = {inf, 0};
  for(int i = 1; i <= r; i++) {
    for(int j = 1; j <= c; j++) {
      if(a[i][j] == 0) continue;

      int lx = j - 1, rx = j + 1, cnt = 1;
      while(lx >= 1 && a[i][lx] && max_e >= a[i][lx]) {
        cnt++, lx--;
      }

      while(rx <= c && a[i][rx] && max_w >= a[i][rx]) {
        cnt++, rx++;
      }

      if(answ.first > cnt) {
        answ = {cnt, 1};
      } else if(answ.first == cnt) {
        answ.second++;
      }
    }
  }
  
  cout << answ.first << '\n';
  cout << answ.second << '\n';
}
 
int main() {
  setIO();
 
  auto solve = [&](int test_case)-> void {
    for(int i = 1; i <= test_case; i++) {
      solve_();
    }
  };
 
  int test_cases = 1;
  // cin >> test_cases;
  solve(test_cases);
 
  return 0;
}

Compilation message

virus.cpp: In function 'void solve_()':
virus.cpp:95:7: warning: unused variable 'flag' [-Wunused-variable]
   95 |   int flag = 1;
      |       ^~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 30 ms 3092 KB Output is correct
3 Correct 210 ms 3132 KB Output is correct
4 Correct 156 ms 3148 KB Output is correct
5 Correct 38 ms 3148 KB Output is correct
6 Correct 1 ms 3156 KB Output is correct
7 Correct 317 ms 3424 KB Output is correct
8 Correct 18 ms 2320 KB Output is correct

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 30 ms 3092 KB Output is correct
3 Correct 210 ms 3132 KB Output is correct
4 Correct 156 ms 3148 KB Output is correct
5 Correct 38 ms 3148 KB Output is correct
6 Correct 1 ms 3156 KB Output is correct
7 Correct 317 ms 3424 KB Output is correct
8 Correct 18 ms 2320 KB Output is correct
9 Incorrect 0 ms 340 KB Output isn't correct
10 Halted 0 ms 0 KB -