Submission #1258489


Source Code Expand

#include <bits/stdc++.h>
#include<vector>
#include<queue>

#define ll long long
#define ld long double

using namespace std;

const int MAXN = 1001 * 1001 , MOD = 1e9 + 7 ;

string s[MAXN] ;


int cmp(string s , string t , char x)
{
    int n = s.size() ;
    for(int i = 0 ; i < n ; i ++  ) if(s[i]=='?') s[i] = x ;
    if(s<t) return 0 ;
    if(s==t) return 1 ;
    return 2 ;
}

int main() {
    ios::sync_with_stdio(0) ;
    cin.tie(0) ; cout.tie(0) ;
    int n ;
    cin >> n ;
    for(int i = 0 ; i < n ; i ++ )
        cin >> s[i] ;
    string t ;
    cin >> t ;

    int x = 0 , y = 0 ;

    int m = t.size() ;

    for(int i = 0 ; i < n ; i ++ )
    {
        if(!cmp(s[i],t,'z'))
            x ++ ;
    }


    for(int i = 0 ; i < n ; i ++ )
    {
        if(cmp(s[i],t,'a')==2)
            y ++ ;
    }

  //  cout << x << ' ' << y << endl ;

    //for(int i = 1 ; i <= n ; i ++ )
    int a = n - y , b = n - x ;

    for(int i = x + 1 ; i + y  <= n + 1 ; i ++ )
        cout << i << ' ' ;
    cout << '\n' ;

    return 0;
}

Submission Info

Submission Time
Task A - Atcoder Handles
User alish
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1098 Byte
Status WA
Exec Time 9 ms
Memory 8576 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 5 ms 8064 KB
sub1_in2.txt WA 5 ms 8192 KB
sub1_in3.txt WA 5 ms 8064 KB
sub2_in1.txt WA 5 ms 8064 KB
sub2_in2.txt WA 7 ms 8320 KB
sub2_in3.txt WA 9 ms 8576 KB