Submission #38232

---

Source Code Expand

#include <cstdio>
#include <vector>
#include <deque>
#include <queue>
#include <map>
#include <algorithm>
#include <functional>
#include <iostream>
#include <string>
#include <cmath>

using namespace std;

int main(void)
{
    int N;
    cin >> N;
    vector<int> as(10);
    for(int i = 0; i < 10; ++i){
        cin >> as[i];
    }
    vector<int> succ(7, 0);
    vector<int> tmp(7, 0);
    for(int i = 0; i < N; ++i){
        string str;
        cin >> str;
        for(int j = 0; j < 7; ++j){
            if (str[j] == 'X'){
                tmp[j]++;
                succ[j] = max(succ[j], tmp[j]);
            }
            else{
                tmp[j] = 0;
            }
        }
    }

//    for(int j = 0; j < 7; ++j){
//        cout << succ[j] << ", ";
//    }
//    cout << endl;

    sort(succ.begin(), succ.end());
    sort(as.begin(), as.end());

    int i = 0;
    int j = 0;
    while(1){
        if (i == 7){
            cout << "YES" << endl;
            return 0;
        }
        if (j == 10){
            cout << "NO" << endl;
            return 0;
        }
        
        if (succ[i] <= as[j]){
            ++i;
            ++j;
        }
        else{
            ++j;
        }
    }
    
    return 0;
}

Submission Info

Judge Result