제출 #875825

#제출 시각아이디문제언어결과실행 시간메모리
875825resfastSelling RNA Strands (JOI16_selling_rna)C++17
60 / 100
1556 ms5308 KiB
#include <bits/stdc++.h> using namespace std; #define islam_zymchybekov void solve() #define ios ios::sync_with_stdio(false); cin.tie(NULL); #define pb push_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define fr first #define sc second #define YES cout<<"YES"<<endl; #define NO cout<<"NO"<<endl; #define endl '\n' #define nl cout<<'\n'; #define int long long #define stg string #define yes cout<<"Yes\n"; #define no cout<<"No\n"; typedef vector<int> vi; typedef pair<int,int> pi; int c,n,m,i,j,k,x,y,cnt=0,res=0,l=0,mx=-1,sum=0,nx=-1; islam_zymchybekov{ string s, s1; cin >> n >> m; if(n<5001){ vector<string>v(n); for(i=0;i<n;i++){ cin>>v[i]; } for(i=0;i<m;i++){ cin>>s>>s1; int ans=0; for(j=0;j<n;j++){ if(v[j].size()>=max(s.size(),s1.size())){ if(v[j].substr(0,s.size())==s){ if( v[j].substr(v[j].size()-s1.size())==s1){ ans++; } } } } cout<<ans;nl; } } else{ unordered_map<string, int> mp; for (int i = 0; i < n; i++) { cin >> s; mp[s]++; } for (int i = 0; i < m; i++) { cin >> s >> s1; int ans = 0; int len_s = s.size(); int len_s1 = s1.size(); for (auto &it : mp) { string curr = it.first; int len_curr = curr.size(); if (len_curr >= max(len_s, len_s1)) { if (curr.substr(0, len_s) == s && curr.substr(len_curr - len_s1) == s1) { ans += it.second; } } } cout << ans; nl; } } } main(){ int T = 1; while(T--){ solve(); } return 0; }

컴파일 시 표준 에러 (stderr) 메시지

selling_rna.cpp:77:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   77 | main(){
      | ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...