Submission #3590015


Source Code Expand

#include <string.h>
#include <stdio.h>
#include <iostream>
#include <string>
#include <cstring>
#include <math.h>
#include <set>
#include <vector>
#include <algorithm>
#include <map>

using namespace std;

typedef long long ll;
#define INF 0x3f3f3f3f
#define ESP 1e-8
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))
const double PI = acos(-1.0);

const ll N = 1e5+5;
char s1[N], s2[N];
ll n, m;

ll gcd(ll x, ll y){
    if(x < y)
        swap(x, y);
    ll r = x % y;
    while(r){
        x = y, y = r;
        r = x % y;
    }
    return y;
}

int main(){
    // FILE *fp = freopen("out.txt", "w", stdout);
    // freopen("in.txt", "r", stdin);
    ll i, j;
    while(scanf("%lld%lld", &n, &m) != EOF){
        scanf("%s%s", s1+1, s2+1);
        ll L = n*m/gcd(n, m);
        i = j = 1;
        ll t1=L/n, t2=L/m;
        bool flag = 1;
        while(i<=L && j<=L){
            if(i==j){
                if(s1[(i-1)/t1+1]!=s2[(j-1)/t2+1]){
                    flag = 0;
                    break;
                }
                i += t1;
                j += t2;
            }
            else if(i < j)
                i += t1;
            else if(i > j)
                j += t2;
        }
        if(flag)
            printf("%lld\n", L);
        else
            printf("-1\n");
    }

    // fclose(fp);
    return 0;
}

Submission Info

Submission Time
Task A - Two Abbreviations
User Easy_AI
Language C++14 (GCC 5.4.1)
Score 300
Code Size 1416 Byte
Status AC
Exec Time 3 ms
Memory 384 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:41:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%s%s", s1+1, s2+1);
                                  ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 21
Set Name Test Cases
Sample sample-01.txt, sample-02.txt, sample-03.txt
All sample-01.txt, sample-02.txt, sample-03.txt, sample-01.txt, sample-02.txt, sample-03.txt, subtask01-01.txt, subtask01-02.txt, subtask01-03.txt, subtask01-04.txt, subtask01-05.txt, subtask01-06.txt, subtask01-07.txt, subtask01-08.txt, subtask01-09.txt, subtask01-10.txt, subtask01-11.txt, subtask01-12.txt, subtask01-13.txt, subtask01-14.txt, subtask01-15.txt
Case Name Status Exec Time Memory
sample-01.txt AC 1 ms 256 KB
sample-02.txt AC 3 ms 384 KB
sample-03.txt AC 1 ms 256 KB
subtask01-01.txt AC 1 ms 256 KB
subtask01-02.txt AC 1 ms 256 KB
subtask01-03.txt AC 2 ms 384 KB
subtask01-04.txt AC 2 ms 384 KB
subtask01-05.txt AC 2 ms 384 KB
subtask01-06.txt AC 2 ms 384 KB
subtask01-07.txt AC 1 ms 256 KB
subtask01-08.txt AC 2 ms 384 KB
subtask01-09.txt AC 2 ms 384 KB
subtask01-10.txt AC 2 ms 384 KB
subtask01-11.txt AC 2 ms 384 KB
subtask01-12.txt AC 2 ms 384 KB
subtask01-13.txt AC 2 ms 384 KB
subtask01-14.txt AC 2 ms 384 KB
subtask01-15.txt AC 2 ms 384 KB