Submission #1213092
Source Code Expand
#include <cstdio> #include <cstring> #include <vector> #include <queue> #include <string> #include <algorithm> #include <iostream> #include <string> #include <map> #include <set> #include <functional> #include <iostream> #define MOD 1000000007LL using namespace std; typedef long long ll; typedef pair<int,int> P; int n; string s[10001]; string t; int check(int v){ for(int i=0;i<min(s[v].size(),t.size());i++){ if(s[v][i]=='?'){ if(t[i]!='a')return 2; }else{ if(s[v][i]<t[i])return 2; if(s[v][i]>t[i])return 0; } } if(s[v].size()>t.size())return 0; if(s[v].size()<t.size())return 2; return 1; } int check2(int v){ for(int i=0;i<min(s[v].size(),t.size());i++){ if(s[v][i]=='?'){ if(t[i]!='z')return 0; }else{ if(s[v][i]<t[i])return 2; if(s[v][i]>t[i])return 0; } } if(s[v].size()>t.size())return 0; if(s[v].size()<t.size())return 2; return 1; } int main(void){ scanf("%d",&n); for(int i=0;i<n;i++){ cin >> s[i]; } cin >> t; int cnt=0,l=0; for(int i=0;i<n;i++){ int v=check(i); int v2=check2(i); if(v==1 || v2==1)cnt++; else{ if(v2==2)l++; if(v==2 && v2!=2)cnt++; } } for(int i=l;i<=l+cnt;i++){ printf("%d%c",i+1,i==l+cnt?'\n':' '); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Atcoder Handles |
User | ryoissy |
Language | C++14 (GCC 5.4.1) |
Score | 250 |
Code Size | 1290 Byte |
Status | AC |
Exec Time | 9 ms |
Memory | 896 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:51:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&n); ^
Judge Result
Set Name | Subtask1 | Subtask2 | ||||
---|---|---|---|---|---|---|
Score / Max Score | 130 / 130 | 120 / 120 | ||||
Status |
|
|
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 | AC | 1 ms | 384 KB |
sub1_in2.txt | AC | 2 ms | 384 KB |
sub1_in3.txt | AC | 2 ms | 384 KB |
sub2_in1.txt | AC | 1 ms | 384 KB |
sub2_in2.txt | AC | 5 ms | 640 KB |
sub2_in3.txt | AC | 9 ms | 896 KB |