# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
329813 | 2020-11-22T16:22:51 Z | theshadow_04 | Selling RNA Strands (JOI16_selling_rna) | C++14 | 1500 ms | 15340 KB |
// V T An #include <bits/stdc++.h> #define F first #define S second #define MOD 1000000007 #define pb push_back #define ll long long #define Task "SELLINGRNA" using namespace std; const int maxn = 100005; int n, m, len[maxn]; string s[maxn]; int main() { ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0); if(fopen(Task".inp", "r")){ freopen(Task".inp", "r", stdin); freopen(Task".out", "w", stdout); } cin >> n >> m; for(int i = 1; i <= n; ++i) { cin >> s[i]; len[i] = s[i].length(); s[i] = " " + s[i]; } for(int i = 1; i <= m; ++i) { int ans = 0; string p, q; cin >> p >> q; for(int j = 1; j <= n; ++ j) { string cur = s[j].substr(1, (int) p.size()); if(cur != p) continue; cur = s[j].substr(len[j] - q.size() + 1, (int) q.size()); if(cur == q) ans ++; } cout << ans << "\n"; } } // CHY-AKAV
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 9 ms | 7020 KB | Execution killed with signal 6 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 406 ms | 9708 KB | Output is correct |
2 | Runtime error | 1406 ms | 15340 KB | Execution killed with signal 6 (could be triggered by violating memory limits) |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1519 ms | 4108 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 9 ms | 7020 KB | Execution killed with signal 6 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |