# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
20869 | gs14004 | 돌 옮기기 (GA7_stone) | C++14 | 876 ms | 2532 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |