# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
71199 | octopuses | 구간 성분 (KOI15_interval) | C++17 | 334 ms | 872 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.
//Giorgi Kldiashvili
#include <bits/stdc++.h>
#define ll long long
#define P 100003
#define Q 100019
#define M 1000000007ll
#define N 1000000009ll
using namespace std;
ll C[26], D[26];
pair < ll, ll > now;
set < pair < ll, ll > > S;
set < pair < ll, ll > >::iterator it;
char ch[1520];
int a[1520], b[1520];
int A[26];
int n, m;
int main()
{
scanf("%s", &ch); n = strlen(ch);
for(int i = 1; i <= n; ++ i)
a[i] = ch[i - 1] - 'a';
scanf("%s", &ch); m = strlen(ch);
for(int i = 1; i <= m; ++ i)
b[i] = ch[i - 1] - 'a';
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... |