Submission #1321764


Source Code Expand

#include <string>
#include <vector>
#include <iostream>
#include <algorithm>

using namespace std;
int main() {
    int n;
    cin >> n;
    vector<string> s(n + 1);
    for(int i = 1; i <= n; i++) {
        cin >> s[i];
    }
    string t;
    cin >> t;
    int st = 1, dr = n + 1;
    for(int i = 1; i <= n; i++) {
        string x;
        for(int j = 0; j < s[i].size(); j++) {
            x.push_back(s[i][j]);
            if(x[j] == '?') {
                x[j] = 'a';
            }
        }
        if(x > t) {
            dr--;
        }
        string y;
         for(int j = 0; j < s[i].size(); j++) {
            y.push_back(s[i][j]);
            if(y[j] == '?') {
                y[j] = 'z';
            }
        }
        if(y < t) {
            st++;
        }
    }
    for(int i = st; i <= dr - 1; i++) {
        cout << i << " ";
    }
    cout << dr << " ";
    return 0;
}

Submission Info

Submission Time
Task A - Atcoder Handles
User Viorel123
Language C++14 (GCC 5.4.1)
Score 0
Code Size 935 Byte
Status WA
Exec Time 16 ms
Memory 896 KB

Judge Result

Set Name Subtask1 Subtask2
Score / Max Score 0 / 130 0 / 120
Status
WA × 3
WA × 6
Set Name Test Cases
Subtask1 sub1_in1.txt, sub1_in2.txt, sub1_in3.txt
Subtask2 sub1_in1.txt, sub1_in2.txt, sub1_in3.txt, sub2_in1.txt, sub2_in2.txt, sub2_in3.txt
Case Name Status Exec Time Memory
sub1_in1.txt WA 1 ms 256 KB
sub1_in2.txt WA 2 ms 256 KB
sub1_in3.txt WA 2 ms 256 KB
sub2_in1.txt WA 1 ms 256 KB
sub2_in2.txt WA 9 ms 640 KB
sub2_in3.txt WA 16 ms 896 KB