# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
68407 | 2018-08-17T05:49:05 Z | KLPP | Selling RNA Strands (JOI16_selling_rna) | C++14 | 1500 ms | 36404 KB |
#include<iostream> #include<vector> #include<algorithm> #include<stdio.h> using namespace std; #define MOD 1000000007 #define BASE 257 typedef long long int lld; bool cmp(string a, string b){ for(int i=0;i<a.size() && i<b.size();i++){ if(a.at(i)<b.at(i))return true; if(a.at(i)>b.at(i))return false; } if(a.length()<=b.length())return true; return false; } bool cmp2(string a, string b){ for(int i=0;i<a.size() && i<b.size();i++){ if(a.at(i)<b.at(i))return true; if(a.at(i)>b.at(i))return false; } if(a.length()>b.length())return true; return false; } int main(){ int n,m; cin>>n>>m; string arr[n]; for(int i=0;i<n;i++){ cin>>arr[i]; } sort(arr,arr+n); vector<lld> hashes[n]; for(int i=0;i<n;i++){ lld v=1; lld h=0; for(int j=arr[i].size()-1;j>-1;j--){ h+=v*arr[i].at(j); h%=MOD; v*=BASE; v%=MOD; hashes[i].push_back(h); } } while(m--){ string p,q; cin>>p>>q; lld hashq=0; lld v=1; for(int i=q.size()-1;i>-1;i--){ hashq+=v*q.at(i); v*=BASE; v%=MOD; } int lo,hi; lo=-1; hi=n; int pos=0; while(hi-lo>1){ int mid=(hi+lo)/2; if(cmp(p,arr[mid]))hi=mid; else lo=mid; } int comeco=hi; lo=comeco-1; hi=n; while(hi-lo>1){ int mid=(hi+lo)/2; if(cmp2(p,arr[mid]))hi=mid; else lo=mid; } int fim=lo; int cnt=0; //cout<<comeco<<" "<<fim<<endl; //cout<<hashq<<endl; for(int i=comeco;i<=fim;i++){ if(hashes[i].size()>=q.length() && hashes[i][q.length()-1]==hashq){ cnt++; } }cout<<cnt<<endl; } return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 261 ms | 26564 KB | Output is correct |
2 | Correct | 406 ms | 33312 KB | Output is correct |
3 | Incorrect | 320 ms | 36404 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1560 ms | 36404 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |