oj.uz

Submission #528596

# Submission time Handle Problem Language Result Execution time Memory
528596 2022-02-20T16:49:38 Z penguinhacker Sateliti (COCI20_satellti) C++14
10 / 110
 86 ms 10892 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ar array

// '*'<'.'

const int M=1e9+9;

ar<int, 2> operator+(ar<int, 2> a, ar<int, 2> b) {
	ar<int, 2> c;
	for (int i : {0, 1})
		if ((c[i]=a[i]+b[i])>=M)
			c[i]-=M;
	return c;
}
 
ar<int, 2> operator-(ar<int, 2> a, ar<int, 2> b) {
	ar<int, 2> c;
	for (int i : {0, 1})
		if ((c[i]=a[i]-b[i])<0)
			c[i]+=M;
	return c;
}
 
ar<int, 2> operator*(ar<int, 2> a, ar<int, 2> b) {
	return {(ll)a[0]*b[0]%M, (ll)a[1]*b[1]%M};
}

const ar<int, 2> B1={343247, 34012321}, B2={6961, 72313};
int n, m;
ar<int, 2> a[2001][2001], b[2000][2001], p1[2000], p2[2000];
string s[2000];

ar<int, 2> Get(int i, int j, int di, int dj) {
	return (a[i+di][j+dj]-a[i+di][j]-a[i][j+dj]+a[i][j])*p1[n-i-1]*p2[m-j-1];
}

ar<int, 2> Get2(int i, int j, int dj) {
	return (b[i][j+dj]-b[i][j])*p1[m-j-1];
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	p1[0]=p2[0]={1, 1};
	cin >> n >> m;
	for (int i=0; i<n; ++i) {
		cin >> s[i];
		s[i]+=s[i];
		s[n+i]=s[i];
	}
	for (int i=1; i<2*n; ++i)
		p1[i]=B1*p1[i-1];
	for (int i=1; i<2*m; ++i)
		p2[i]=B2*p2[i-1];
	for (int i=0; i<2*n; ++i)
		for (int j=0; j<2*m; ++j)
			a[i+1][j+1]=a[i+1][j]+a[i][j+1]-a[i][j]+(s[i][j]=='*'?ar<int, 2>{}:p1[i]*p2[j]);
	for (int i=0; i<2*n; ++i)
		for (int j=0; j<2*m; ++j)
			b[i][j+1]=b[i][j]+(s[i][j]=='*'?ar<int, 2>{}:p1[j]);
	ar<int, 2> ans={0, 0};
	for (int i=0; i<n; ++i)
		for (int j=0; j<m; ++j) {
			if (!i&&!j)
				continue;
			if (Get(i, j, n, m)==Get(ans[0], ans[1], n, m))
				continue;
			int l=1, r=n;
			while(l<r) {
				int mid=(l+r)/2;
				if (Get(i, j, mid, m)!=Get(ans[0], ans[1], mid, m))
					r=mid;
				else
					l=mid+1;
			}
			int di=l-1;
			l=1, r=m;
			while(l<r) {
				int mid=(l+r)/2;
				if (Get2(i+di, j, mid)!=Get2(ans[0]+di, ans[1], mid))
					r=mid;
				else
					l=mid+1;
			}
			int dj=l-1;
			//assert(s[i+di][j+dj]!=s[ans[0]+di][ans[1]+dj]);
			if (s[i+di][j+dj]<s[ans[0]+di][ans[1]+dj])
				ans={i, j};
		}
	for (int i=0; i<n; ++i)
		cout << s[i+ans[0]].substr(ans[1], m) << "\n";
	return 0;
}

Compilation message

Main.cpp: In function 'std::array<int, 2> operator*(std::array<int, 2>, std::array<int, 2>)':
Main.cpp:28:23: warning: narrowing conversion of '((((long long int)a.std::array<int, 2>::operator[](0)) * ((long long int)b.std::array<int, 2>::operator[](0))) % ((long long int)((int)M)))' from 'long long int' to 'int' [-Wnarrowing]
   28 |  return {(ll)a[0]*b[0]%M, (ll)a[1]*b[1]%M};
      |          ~~~~~~~~~~~~~^~
Main.cpp:28:40: warning: narrowing conversion of '((((long long int)a.std::array<int, 2>::operator[](1)) * ((long long int)b.std::array<int, 2>::operator[](1))) % ((long long int)((int)M)))' from 'long long int' to 'int' [-Wnarrowing]
   28 |  return {(ll)a[0]*b[0]%M, (ll)a[1]*b[1]%M};
      |                           ~~~~~~~~~~~~~^~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1356 KB Output is correct
2 Correct 4 ms 1228 KB Output is correct
3 Correct 3 ms 1228 KB Output is correct
4 Correct 1 ms 1228 KB Output is correct
5 Correct 3 ms 1228 KB Output is correct
6 Correct 3 ms 1332 KB Output is correct
7 Correct 2 ms 1228 KB Output is correct

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1356 KB Output is correct
2 Correct 4 ms 1228 KB Output is correct
3 Correct 3 ms 1228 KB Output is correct
4 Correct 1 ms 1228 KB Output is correct
5 Correct 3 ms 1228 KB Output is correct
6 Correct 3 ms 1332 KB Output is correct
7 Correct 2 ms 1228 KB Output is correct
8 Correct 86 ms 10892 KB Output is correct
9 Incorrect 2 ms 716 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1356 KB Output is correct
2 Correct 4 ms 1228 KB Output is correct
3 Correct 3 ms 1228 KB Output is correct
4 Correct 1 ms 1228 KB Output is correct
5 Correct 3 ms 1228 KB Output is correct
6 Correct 3 ms 1332 KB Output is correct
7 Correct 2 ms 1228 KB Output is correct
8 Correct 86 ms 10892 KB Output is correct
9 Incorrect 2 ms 716 KB Output isn't correct
10 Halted 0 ms 0 KB -