제출 #773785

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
773785		Filya	바이러스 (JOI19_virus)	C++14	14 / 100	358 ms	9100 KiB

virus

//♥God will make a way♥

//#include <bits/stdc++.h>
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cassert>
#include <set>
#include <map>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stdio.h>
#include <climits>
#include <numeric>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//template <typename T>
//using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
/////////////////////define/////////////////////
#define ci(x) if(x) cout << "YES" << '\n'; else cout << "NO" << '\n';
#define cii(x) if(check(x))
#define MOD 1000000007
#define MOD2 998244353
#define oo 1e9
#define ool 1e18L
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mii map<int, int>
#define vi vector<int>
#define vpi vector<pair<int, int>>
#define vll vector <ll>
#define ff first
#define ss second
#define mp make_pair
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define sz(x) (int((x).size()))
#define all(x) (x).begin(), (x).end()
#define alll(x) (x), (x) + n
#define clr(x) (x).clear();
#define fri(x) for(int i = 0; i < x; ++i)
#define frj(x) for(int j = 0; j < x; ++j)
#define frp(x) for(int p = 0; p < x; ++p)
#define frr(a, b) for(int i = a; i < b; ++i)
#define frrj(a, b) for(int j = a; j < b; ++j)
#define fra(x) for(int i = 0; i < x; ++i) cin >> a[i];
#define frb(x) for(int i = 0; i < x; ++i) cin >> b[i];
#define frs(x) for(auto it = x.begin(); it != x.end(); ++it)
#define fr(x) for(auto it : x) //el
#define fastio ios_base::sync_with_stdio(false); cin.tie(0);
#define dbg(x) cerr << #x << ": " << x << endl;
#define ce(x) cout << x << endl;
#define uniq(x) x.resize(unique(all(x)) - x.begin()); //make all one after sorting
#define blt __builtin_popcount
/////////////////////print array, vector, deque, set, multiset, pair, map /////////////////////
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;}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]"; cout << endl;}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(stack <T> v) {cerr << "[ "; stack<T> s = v; while(s.size()) {T i = s.top(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(queue <T> v) {cerr << "[ "; queue<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(deque <T> v) {cerr << "[ "; deque<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop_front(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
/////////////////////code/////////////////////
int ans[805][805], a[805][805];
int main() {
    fastio;
    int n, r, c; cin >> n >> r >> c;
    string s; cin >> s;
    fri(r) {
        frj(c) {
            cin >> a[i][j];
        }
    }
    fri(n) {
        if(s[i] == 'W') s[i] = 'E';
        else if(s[i] == 'E') s[i] = 'W';
        else if(s[i] == 'N') s[i] = 'S';
        else s[i] = 'N';
    }
    int e = 0, w = 0, maxe = 0, maxw = 0;
    fri(n) {
        if(s[i] == 'W') {
            w++;
            e = 0;
        }
        else {
            e++;
            w = 0;
        }
        maxw = max(maxw, w);
        maxe = max(maxe, e);
    }
    if(s[0] == s[n-1]) {
        if(s[0] == 'E') {
            e = 0;
            fri(n) {
                if(s[i] == 'E') e++;
                else break;
            }
            for(int i = n-1; i >= 0; i--) {
                if(s[i] == 'E') e++;
                else break;
            }
            if(e > n) maxe = 1e9;
            maxe = max(e, maxe);
        } else if(s[0] == 'W') {
            w = 0;
            fri(n) {
                if(s[i] == 'W') w++;
                else break;
            }
            for(int i = n-1; i >= 0; i--) {
                if(s[i] == 'W') w++;
                else break;
            }
            if(w > n) maxw = 1e9;
            maxw = max(w, maxw);
        }
    }
    // dbg(maxw) dbg(maxe)
    int mini = 1e9;
    fri(r) {
        frj(c) {
            if(!a[i][j]) continue;
            ans[i][j] = 1;
            for(int p = j + 1; p < c; p++) {
                if(!a[i][p] || a[i][p] > maxe) break;
                ans[i][j]++;
            }
            for(int p = j - 1; p >= 0; --p) {
                if(!a[i][p] || a[i][p] > maxw) break;
                ans[i][j]++;
            }
            mini = min(mini, ans[i][j]);
        }
    }
    int cnt = 0;
    fri(r) frj(c) if(ans[i][j] == mini) cnt++;
    cout << mini << endl;
    cout << cnt;
    return 0;
}

• Subtask 1: 14 / 14
• Subtask 2: 0 / 6
• Subtask 3: 0 / 80