# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
20869 | 2017-02-28T16:18:22 Z | gs14004 | 돌 옮기기 (GA7_stone) | C++14 | 876 ms | 2532 KB |
#include <bits/stdc++.h> using namespace std; typedef long long lint; typedef long double llf; typedef pair<lint, lint> pi; const int mod = 1e9 + 7; string s; int l, n; int main(){ cin >> l >> n; for(int i=0; i<n; i++){ char t[5]; scanf("%*d %s",t); s.push_back(*t); } string t = s + s; int ans = 1e9; for(int i=1; i<n; i++){ if(t.substr(i, n) == s) ans = min({ans, i, n-i}); } if(ans > 1e8){ puts("-1"); return 0; } cout << 1ll * ans * l; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 2020 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 2020 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 2020 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 2020 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 876 ms | 2532 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |