# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
293252 | CaroLinda | Monochrome Points (JOI20_monochrome) | C++14 | 2078 ms | 384 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>
#define pb push_back
#define ll long long
#define pii pair<int,int>
#define mk make_pair
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
#define debug printf
#define lp(i,a,b) for(int i = a ; i < b ; i++ )
#define sz(x) (int)(x.size())
const int MAXN = 4010 ;
using namespace std ;
int N , ans ;
int myPair[MAXN] ;
vector<int> aux ;
vector<pii> lines ;
char str[MAXN] ;
int checkIntersection( pii p1 , pii p2 )
{
int type1 = ( p2.ff > p1.ff && p2.ff < p1.ss )&( p2.ss > p1.ff && p2.ss < p1.ss ) ;
int type2 = ( p2.ff > p1.ss || p2.ff < p1.ff )&( p2.ss > p1.ss || p2.ss < p1.ff ) ;
return type1 == 0 && type2 == 0 ;
}
int main()
{
scanf("%d", &N ) ;
scanf("%s", str ) ;
for(int i = 1 ; i < 2*N ; i++ )
{
if( str[i] == str[0] ) continue ;
lines.clear() ;
int idx = i ;
lines.pb( mk(0,i) ) ;
for(int j = 1 ; j != 2*N ; j++ )
{
if( str[j] != str[0] ) continue ;
idx = (idx == 2*N - 1) ? 0 : idx+1 ;
while( str[idx] == str[j] )
{
if(idx == 2*N - 1) idx = 0 ;
else idx++ ;
}
if( idx < j ) lines.pb(mk(idx,j)) ;
else lines.pb( mk(j,idx) ) ;
}
int temp = 0 ;
for(int a = 0 ; a < sz(lines) ; a++ )
for(int b = a+1 ; b < sz(lines) ; b++ )
temp += checkIntersection( lines[a] , lines[b] ) ;
ans = max(ans, temp) ;
}
printf("%d\n" , ans ) ;
}
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... |