Submission #1006906

---

Source Code Expand

//*
#include <stdio.h>
#include <string.h>
#include <ctype.h>
#include <time.h>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <numeric>
#include <functional>
#define MOD 1000000007
#define MAX 0x3f3f3f3f
#define MAX2 0x3f3f3f3f3f3f3f3fll
#define ERR 1e-10
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#pragma warning(disable:4996)
using namespace std;

typedef long long ll;
typedef long double ldb;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;

int n;
char a[2000000], b[2000000];

int main()
{
	int i, j, k, l;
	cin>>n;
	scanf("%s%s", a, b);
	for(i=0;i<n;i++) if(a[i] != b[i]) break;
	if(i == n) return !printf("0\n");
	vector<pair<pii, char>> av, bv;
	vector<pii> g;
	int st=0;
	for(i=0;i<n;i++)
	{
		if(a[i] != a[i+1])
		{
			av.emplace_back(mp(st, i), a[i]);
			st=i+1;
		}
	}
	st=0;
	for(i=0;i<n;i++)
	{
		if(b[i] != b[i+1])
		{
			bv.emplace_back(mp(st, i), b[i]);
			st=i+1;
		}
	}
	int avi=av.size()-1;
	for(i=bv.size()-1;i>=0;i--)
	{
		int bad=0;
		while(1)
		{
			if(avi == -1)
			{
				bad=1;
				break;
			}
			if(av[avi].first.first > bv[i].first.first || av[avi].second != bv[i].second)
			{
				avi--;
				continue;
			}
			g.emplace_back(min(av[avi].first.second, bv[i].first.first), bv[i].first.second);
			break;
		}
		if(bad == 1) return !printf("-1\n");
	}
	int ma=0;
	sort(all(g));
	for(i=0;i<g.size();i++)
	{
		int low=i+1, high=g.size()-1, mid;
		while(low <= high)
		{
			mid=(low+high)/2;
			if(g[mid].first-(mid-1-i) <= g[i].second) low=mid+1;
			else high=mid-1;
		}
		ma=max(ma, low-i);
	}
	cout<<ma<<endl;
	return 0;
}
//*/

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:38:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s%s", a, b);
                     ^

Judge Result