# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
103458 | pedro_sponchiado | Three Friends (BOI14_friends) | C++17 | 20 ms | 7168 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;
const int maxn=2000010;
int n_, n;
char str[maxn], s1[maxn], s2[maxn], s3[maxn], s4[maxn];
int mini;
int verif(char str1[maxn], char str2[maxn]){
for(int i=0; i<=n; i++){
if(str1[i]!=str2[i]){
mini=i;
break;
}
}
// printf("mini=%d\n", mini);
int cont=0, da=1;
for(int i=0; i<n; i++){
if(cont==mini) cont++;
// printf("%c %c\n", str1[i], str2[cont]);
if(str1[i]!=str2[cont]) da=0;
cont++;
}
// printf("%d\n", da);
if(da==0) return 0;
if( (str2[mini]==str2[mini-1] && mini>=1) || (str2[mini]==str2[mini+1] && mini<=n-1) ) return 2;
return 1;
}
int main(){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |