oj.uz

Submission #800505

# Submission time Handle Problem Language Result Execution time Memory
800505 2023-08-01T15:41:18 Z lollipop Rectangles (IOI19_rect) C++17
72 / 100
 1704 ms 1048576 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define ll long long
#define pb push_back
#define s second
#define f first
#define pf push_front
#define inf 100000000000000000
#define bitebi __builtin_popcountll
#define FOR( i , n ) for( int i = 0 ; i < n ; i ++ )
#define YES cout <<"YES\n"
#define NO cout << "NO\n"
#define debug cout << "Here Fine" << endl ;
#define pr pair < int , int >
#define fbo find_by_order // returns iterator
#define ook order_of_key // returns strictly less numbers than key
using namespace std ;
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
const double Pi=acos(-1.0);
const double EPS=1E-8;
const int mod =  1000000007 ;
const int mod1 = 998244353 ;
const int NN = 6e5 + 10 ;
mt19937 R(time(0));
map < int , int > ma , ma1 ;
#include "rect.h"
int n , m ;
vector < int > h[ 2505 ][ 2505 ] , w[ 2505 ][ 2505 ] ;
vector<vector<int> > a ;
 
void pot_build(){
    FOR( i , n ){
    	int clos[ 2501 ] ;	    	
    	stack < int > st ;
    	FOR( j , m ){
    		clos[ j ] = -1 ; 
	    	while( true ){
	    		if( st.size() == 0 ) break ;
	    		int x = st.top() ;	    		
	    		if( a[ i ][ x ] < a[ i ][ j ] ){
	    			clos[ x ] = j ; st.pop() ; 
				} else break ;
			}
			st.push( j ) ;
	    }
	    FOR( j , m ){
	       int lst = j + 1 ;
	       while( true ){
	       	 if( lst >= m || lst == -1 ) break ;
	       	 int nx = clos[ lst ] ;
	       	 if( a[ i ][ lst ] >= a[ i ][ j ] ) break ; 
	       	 if( nx != -1 ) w[ j ][ nx ].pb( i ) ;
	       	 lst = nx ; 
		   }
		}
	}  	
	// now for the horizontal ones 
    FOR( j , m ){
    	int clos[ 2501 ] ; stack < int > st ;
    	FOR( i , n ){
    		clos[ i ] = -1 ; 
	    	while( true ){
	    		if( st.size() == 0 ) break ;
	    		int x = st.top() ;
	    		if( a[ x ][ j ] < a[ i ][ j ] ){
	    			clos[ x ] = i ; st.pop() ; 
				} else break ;
			}
			st.push( i ) ;
	    }
	    FOR( i , n ){
	       int lst = i + 1 ;
	       while( true ){
	       	 if( lst >= n || lst == -1 ) break ;
	       	 int nx = clos[ lst ] ;
	       	 if( a[ lst ][ j ] >= a[ i ][ j ] ) break ; 
	       	 if( nx != -1 ) h[ i ][ nx ].pb( j ) ;
	       	 lst = nx ; 
		   }
		}
	}  	 
}
struct W{
	int l , high ;
};
struct H{
	int high , l ;
};
vector < W > ww[ 2505 ][ 2505 ] ;
vector < H > hh[ 2505 ][ 2505 ] ; 
void make_potential_sides(){
	 FOR( j , m ){
	 	for( int j1 = j + 1 ; j1 < m ; j1 ++ ){
	 		if( w[ j ][ j1 ].size() == 0 ) continue ;
	 		int lst = w[ j ][ j1 ][ 0 ] ;
	 		int fr = w[ j ][ j1 ][ 0 ] ;
	 		for( int ps = 1 ; ps < w[ j ][ j1 ].size() ; ps ++ ){
	 		     if( w[ j ][ j1 ][ ps ] - 1 != lst ){
	 		     	// push for future 
	 		     	W cur ; cur.l = j , cur.high = fr ;
	 		     	for( int kk = fr ; kk <= lst ; kk ++ ) ww[ kk ][ j1 ].pb( cur ) ;
	 		     	// make for new 
	 		     	fr = w[ j ][ j1 ][ ps ] ; 
	 		     	lst = w[ j ][ j1 ][ ps ] ;
				 }
				 else lst = w[ j ][ j1 ][ ps ] ; 	
			}
	 		// push for future 
	 		W cur ; cur.l = j , cur.high = fr ;
	 		for( int kk = fr ; kk <= lst ; kk ++ ) ww[ kk ][ j1 ].pb( cur ) ;
		 }
	 }
	 // now for horizontals 
	 FOR( i , n ){
	 	for( int i1 = i + 1 ; i1 < n ; i1 ++ ){
	 		if( h[ i ][ i1 ].size() == 0 ) continue ;
	 		int lst = h[ i ][ i1 ][ 0 ] ;
	 		int fr = h[ i ][ i1 ][ 0 ] ;
	 		for( int ps = 1 ; ps < h[ i ][ i1 ].size() ; ps ++ ){
	 		     if( h[ i ][ i1 ][ ps ] - 1 != lst ){
	 		     	// push for future 
	 		     	H cur ; cur.high = i , cur.l = fr ;
	 		     	for( int kk = fr ; kk <= lst ; kk ++ ) hh[ i1 ][ kk ].pb( cur ) ;
	 		     	// make for new 
	 		     	fr = h[ i ][ i1 ][ ps ] ; 
	 		     	lst = h[ i ][ i1 ][ ps ] ;
				 }
				 else lst = h[ i ][ i1 ][ ps ] ; 	
			}
	 		// push for future 
	 		H cur ; cur.high = i , cur.l = fr  ;
	 	    for( int kk = fr ; kk <= lst ; kk ++ ) hh[ i1 ][ kk ].pb( cur ) ;
		 }
	 }	 
}
// sort to make the problem solvable
bool sortbyw( W a , W b ){
	 return a.high > b.high ;
}
bool sortbyh( H a , H b ){
	 return a.high > b.high ; 
}
// get the sum ==> number of intersections
int fen[ 3000 ] ;
void add( int pos , int val ){
	 pos ++ ; 
	 for( int j = pos ; j < 3000 ; j = j + ( j & ( - j ) ) ) fen[ j ] += val ;
}
int get( int l , int r ){
	l ++ , r ++ ;
	int sum = 0 ;
	for( int j = r ; j > 0 ; j = j - ( j & ( - j ) ) ) sum += fen[ j ] ;
	for( int j = l - 1 ; j > 0 ; j = j - ( j & ( - j ) ) ) sum -= fen[ j ] ;
	return sum ;	
}
long long count_rectangles(vector<vector<int> > A){
    n = A.size() , m = A[ 0 ].size() ; a = A ; 
 	pot_build() ;
  	make_potential_sides() ;
  	FOR( i , n ) FOR( j , m ){
  	   sort( ww[ i ][ j ].begin() , ww[ i ][ j ].end() , sortbyw ) ;
	   sort( hh[ i ][ j ].begin() , hh[ i ][ j ].end() , sortbyh ) ;	
	}
	// now calculate the answer
    ll ans = 0 ;
    FOR( i , n ){
    	FOR( j , m ){
    		// consider this as the low right spot 
    		if( j == 0 || i == 0 ) continue ;
    		int pos = 0 ;
    	//	cout << get( 0 , m ) << endl ;
    		for( auto x : ww[ i - 1 ][ j ] ){
    			add( x.l , 1 ) ;
			}
			for( auto x : hh[ i ][ j - 1 ] ){
				while( true ){
					if( pos == ww[ i - 1 ][ j ].size() ) break ;
					if( ww[ i - 1 ][ j ][ pos ].high <= x.high + 1 ) break ;
					add( ww[ i - 1 ][ j ][ pos ].l , -1 ) ;
					pos ++ ;
				}
				ans = ans + get( x.l - 1 , j - 2 ) ;
			}
		//	cout << i << " " << j << " " << ans << endl ;
		//	cout << ww[ i - 1 ][ j ].size() << " " << hh[ i ][ j - 1 ].size() << endl ;
			for( ; pos < ww[ i - 1 ][ j ].size() ; pos ++ ){
				add( ww[ i - 1 ][ j ][ pos ].l , -1 ) ;				
			}
		}
	}
	return ans ;
}
 
 
 
//  static const int buf_size = 4096;
 
//  inline int getChar() {
//  	static char buf[buf_size];
//  	static int len = 0, pos = 0;
//  	if (pos == len) {
//  		pos = 0;
//  		len = fread(buf, 1, buf_size, stdin);
//  	}
//  	if (pos == len)
//  		return -1;
//  	return buf[pos++];
//  }
 
//  inline int readChar() {
//  	int c = getChar();
//  	while (c <= 32)
//  		c = getChar();
//  	return c;
//  }
 
//  inline int readInt() {
//  	int s = 1, c = readChar();
//  	int x = 0;
//  	while ('0' <= c && c <= '9') {
//  		x = x * 10 + c - '0';
//  		c = getChar();
//  	}
//  	return x;
//  }
 
//  int main() {
//  	cin >> n ;
//       cin >> m ;
//  	vector<vector<int> > a(n, vector<int>(m));
//  	for (int i = 0; i < n; i++) {
//  		for (int j = 0; j < m; j++) {
//  		    a[i][j] = readInt();
//  		}
//  	}
//  	fclose(stdin);
 
//  	long long result= count_rectangles(a);
 
//  	printf("%lld\n", result);
//  	fclose(stdout);
//  	return 0;
//  }

Compilation message

rect.cpp: In function 'void make_potential_sides()':
rect.cpp:103:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  103 |     for( int ps = 1 ; ps < w[ j ][ j1 ].size() ; ps ++ ){
      |                       ~~~^~~~~~~~~~~~~~~~~~~~~
rect.cpp:125:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  125 |     for( int ps = 1 ; ps < h[ i ][ i1 ].size() ; ps ++ ){
      |                       ~~~^~~~~~~~~~~~~~~~~~~~~
rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:183:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<W>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  183 |      if( pos == ww[ i - 1 ][ j ].size() ) break ;
      |          ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
rect.cpp:192:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<W>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  192 |    for( ; pos < ww[ i - 1 ][ j ].size() ; pos ++ ){
      |           ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 282 ms 589872 KB Output is correct
2 Correct 246 ms 589732 KB Output is correct
3 Correct 245 ms 589768 KB Output is correct
4 Correct 249 ms 589740 KB Output is correct
5 Correct 243 ms 589704 KB Output is correct
6 Correct 249 ms 589756 KB Output is correct
7 Correct 249 ms 589752 KB Output is correct
8 Correct 245 ms 589756 KB Output is correct
9 Correct 248 ms 589772 KB Output is correct
10 Correct 276 ms 589772 KB Output is correct
11 Correct 246 ms 589728 KB Output is correct
12 Correct 246 ms 589916 KB Output is correct
13 Correct 242 ms 589668 KB Output is correct
14 Correct 241 ms 589712 KB Output is correct
15 Correct 252 ms 589640 KB Output is correct
16 Correct 244 ms 589696 KB Output is correct
17 Correct 243 ms 589616 KB Output is correct
18 Correct 257 ms 589712 KB Output is correct
19 Correct 261 ms 589692 KB Output is correct
20 Correct 264 ms 589720 KB Output is correct
21 Correct 264 ms 589624 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 282 ms 589872 KB Output is correct
2 Correct 246 ms 589732 KB Output is correct
3 Correct 245 ms 589768 KB Output is correct
4 Correct 249 ms 589740 KB Output is correct
5 Correct 243 ms 589704 KB Output is correct
6 Correct 249 ms 589756 KB Output is correct
7 Correct 249 ms 589752 KB Output is correct
8 Correct 245 ms 589756 KB Output is correct
9 Correct 248 ms 589772 KB Output is correct
10 Correct 276 ms 589772 KB Output is correct
11 Correct 246 ms 589728 KB Output is correct
12 Correct 246 ms 589916 KB Output is correct
13 Correct 242 ms 589668 KB Output is correct
14 Correct 241 ms 589712 KB Output is correct
15 Correct 252 ms 589640 KB Output is correct
16 Correct 244 ms 589696 KB Output is correct
17 Correct 243 ms 589616 KB Output is correct
18 Correct 257 ms 589712 KB Output is correct
19 Correct 261 ms 589692 KB Output is correct
20 Correct 264 ms 589720 KB Output is correct
21 Correct 264 ms 589624 KB Output is correct
22 Correct 258 ms 590060 KB Output is correct
23 Correct 266 ms 590036 KB Output is correct
24 Correct 260 ms 590044 KB Output is correct
25 Correct 253 ms 589896 KB Output is correct
26 Correct 262 ms 590148 KB Output is correct
27 Correct 248 ms 590100 KB Output is correct
28 Correct 253 ms 590052 KB Output is correct
29 Correct 251 ms 589892 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 282 ms 589872 KB Output is correct
2 Correct 246 ms 589732 KB Output is correct
3 Correct 245 ms 589768 KB Output is correct
4 Correct 249 ms 589740 KB Output is correct
5 Correct 243 ms 589704 KB Output is correct
6 Correct 249 ms 589756 KB Output is correct
7 Correct 249 ms 589752 KB Output is correct
8 Correct 245 ms 589756 KB Output is correct
9 Correct 248 ms 589772 KB Output is correct
10 Correct 276 ms 589772 KB Output is correct
11 Correct 246 ms 589728 KB Output is correct
12 Correct 246 ms 589916 KB Output is correct
13 Correct 242 ms 589668 KB Output is correct
14 Correct 241 ms 589712 KB Output is correct
15 Correct 252 ms 589640 KB Output is correct
16 Correct 244 ms 589696 KB Output is correct
17 Correct 258 ms 590060 KB Output is correct
18 Correct 266 ms 590036 KB Output is correct
19 Correct 260 ms 590044 KB Output is correct
20 Correct 253 ms 589896 KB Output is correct
21 Correct 262 ms 590148 KB Output is correct
22 Correct 248 ms 590100 KB Output is correct
23 Correct 253 ms 590052 KB Output is correct
24 Correct 251 ms 589892 KB Output is correct
25 Correct 243 ms 589616 KB Output is correct
26 Correct 257 ms 589712 KB Output is correct
27 Correct 261 ms 589692 KB Output is correct
28 Correct 264 ms 589720 KB Output is correct
29 Correct 264 ms 589624 KB Output is correct
30 Correct 251 ms 591440 KB Output is correct
31 Correct 248 ms 591436 KB Output is correct
32 Correct 254 ms 591456 KB Output is correct
33 Correct 259 ms 591284 KB Output is correct
34 Correct 261 ms 592188 KB Output is correct
35 Correct 260 ms 592308 KB Output is correct
36 Correct 262 ms 592080 KB Output is correct
37 Correct 281 ms 592100 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 282 ms 589872 KB Output is correct
2 Correct 246 ms 589732 KB Output is correct
3 Correct 245 ms 589768 KB Output is correct
4 Correct 249 ms 589740 KB Output is correct
5 Correct 243 ms 589704 KB Output is correct
6 Correct 249 ms 589756 KB Output is correct
7 Correct 249 ms 589752 KB Output is correct
8 Correct 245 ms 589756 KB Output is correct
9 Correct 248 ms 589772 KB Output is correct
10 Correct 276 ms 589772 KB Output is correct
11 Correct 246 ms 589728 KB Output is correct
12 Correct 246 ms 589916 KB Output is correct
13 Correct 242 ms 589668 KB Output is correct
14 Correct 241 ms 589712 KB Output is correct
15 Correct 252 ms 589640 KB Output is correct
16 Correct 244 ms 589696 KB Output is correct
17 Correct 258 ms 590060 KB Output is correct
18 Correct 266 ms 590036 KB Output is correct
19 Correct 260 ms 590044 KB Output is correct
20 Correct 253 ms 589896 KB Output is correct
21 Correct 262 ms 590148 KB Output is correct
22 Correct 248 ms 590100 KB Output is correct
23 Correct 253 ms 590052 KB Output is correct
24 Correct 251 ms 589892 KB Output is correct
25 Correct 251 ms 591440 KB Output is correct
26 Correct 248 ms 591436 KB Output is correct
27 Correct 254 ms 591456 KB Output is correct
28 Correct 259 ms 591284 KB Output is correct
29 Correct 261 ms 592188 KB Output is correct
30 Correct 260 ms 592308 KB Output is correct
31 Correct 262 ms 592080 KB Output is correct
32 Correct 281 ms 592100 KB Output is correct
33 Correct 243 ms 589616 KB Output is correct
34 Correct 257 ms 589712 KB Output is correct
35 Correct 261 ms 589692 KB Output is correct
36 Correct 264 ms 589720 KB Output is correct
37 Correct 264 ms 589624 KB Output is correct
38 Correct 326 ms 616656 KB Output is correct
39 Correct 325 ms 621360 KB Output is correct
40 Correct 373 ms 621356 KB Output is correct
41 Correct 321 ms 626080 KB Output is correct
42 Correct 321 ms 612528 KB Output is correct
43 Correct 314 ms 612500 KB Output is correct
44 Correct 338 ms 612484 KB Output is correct
45 Correct 314 ms 611540 KB Output is correct
46 Correct 346 ms 604668 KB Output is correct
47 Correct 356 ms 608204 KB Output is correct
48 Correct 456 ms 619912 KB Output is correct
49 Correct 447 ms 620204 KB Output is correct
50 Correct 349 ms 605072 KB Output is correct
51 Correct 347 ms 605044 KB Output is correct
52 Correct 419 ms 617540 KB Output is correct
53 Correct 429 ms 617552 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 259 ms 590060 KB Output is correct
2 Correct 255 ms 590012 KB Output is correct
3 Correct 255 ms 589772 KB Output is correct
4 Correct 253 ms 589616 KB Output is correct
5 Correct 257 ms 590164 KB Output is correct
6 Correct 259 ms 590188 KB Output is correct
7 Correct 255 ms 590156 KB Output is correct
8 Correct 256 ms 590080 KB Output is correct
9 Correct 257 ms 590144 KB Output is correct
10 Correct 259 ms 589848 KB Output is correct
11 Correct 254 ms 589956 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 243 ms 589616 KB Output is correct
2 Correct 257 ms 589712 KB Output is correct
3 Correct 261 ms 589692 KB Output is correct
4 Correct 264 ms 589720 KB Output is correct
5 Correct 264 ms 589624 KB Output is correct
6 Correct 255 ms 589672 KB Output is correct
7 Correct 737 ms 678056 KB Output is correct
8 Correct 1409 ms 780772 KB Output is correct
9 Correct 1400 ms 781596 KB Output is correct
10 Correct 1446 ms 781708 KB Output is correct
11 Correct 350 ms 626108 KB Output is correct
12 Correct 487 ms 658896 KB Output is correct
13 Correct 496 ms 663412 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 282 ms 589872 KB Output is correct
2 Correct 246 ms 589732 KB Output is correct
3 Correct 245 ms 589768 KB Output is correct
4 Correct 249 ms 589740 KB Output is correct
5 Correct 243 ms 589704 KB Output is correct
6 Correct 249 ms 589756 KB Output is correct
7 Correct 249 ms 589752 KB Output is correct
8 Correct 245 ms 589756 KB Output is correct
9 Correct 248 ms 589772 KB Output is correct
10 Correct 276 ms 589772 KB Output is correct
11 Correct 246 ms 589728 KB Output is correct
12 Correct 246 ms 589916 KB Output is correct
13 Correct 242 ms 589668 KB Output is correct
14 Correct 241 ms 589712 KB Output is correct
15 Correct 252 ms 589640 KB Output is correct
16 Correct 244 ms 589696 KB Output is correct
17 Correct 258 ms 590060 KB Output is correct
18 Correct 266 ms 590036 KB Output is correct
19 Correct 260 ms 590044 KB Output is correct
20 Correct 253 ms 589896 KB Output is correct
21 Correct 262 ms 590148 KB Output is correct
22 Correct 248 ms 590100 KB Output is correct
23 Correct 253 ms 590052 KB Output is correct
24 Correct 251 ms 589892 KB Output is correct
25 Correct 251 ms 591440 KB Output is correct
26 Correct 248 ms 591436 KB Output is correct
27 Correct 254 ms 591456 KB Output is correct
28 Correct 259 ms 591284 KB Output is correct
29 Correct 261 ms 592188 KB Output is correct
30 Correct 260 ms 592308 KB Output is correct
31 Correct 262 ms 592080 KB Output is correct
32 Correct 281 ms 592100 KB Output is correct
33 Correct 326 ms 616656 KB Output is correct
34 Correct 325 ms 621360 KB Output is correct
35 Correct 373 ms 621356 KB Output is correct
36 Correct 321 ms 626080 KB Output is correct
37 Correct 321 ms 612528 KB Output is correct
38 Correct 314 ms 612500 KB Output is correct
39 Correct 338 ms 612484 KB Output is correct
40 Correct 314 ms 611540 KB Output is correct
41 Correct 346 ms 604668 KB Output is correct
42 Correct 356 ms 608204 KB Output is correct
43 Correct 456 ms 619912 KB Output is correct
44 Correct 447 ms 620204 KB Output is correct
45 Correct 349 ms 605072 KB Output is correct
46 Correct 347 ms 605044 KB Output is correct
47 Correct 419 ms 617540 KB Output is correct
48 Correct 429 ms 617552 KB Output is correct
49 Correct 259 ms 590060 KB Output is correct
50 Correct 255 ms 590012 KB Output is correct
51 Correct 255 ms 589772 KB Output is correct
52 Correct 253 ms 589616 KB Output is correct
53 Correct 257 ms 590164 KB Output is correct
54 Correct 259 ms 590188 KB Output is correct
55 Correct 255 ms 590156 KB Output is correct
56 Correct 256 ms 590080 KB Output is correct
57 Correct 257 ms 590144 KB Output is correct
58 Correct 259 ms 589848 KB Output is correct
59 Correct 254 ms 589956 KB Output is correct
60 Correct 255 ms 589672 KB Output is correct
61 Correct 737 ms 678056 KB Output is correct
62 Correct 1409 ms 780772 KB Output is correct
63 Correct 1400 ms 781596 KB Output is correct
64 Correct 1446 ms 781708 KB Output is correct
65 Correct 350 ms 626108 KB Output is correct
66 Correct 487 ms 658896 KB Output is correct
67 Correct 496 ms 663412 KB Output is correct
68 Correct 243 ms 589616 KB Output is correct
69 Correct 257 ms 589712 KB Output is correct
70 Correct 261 ms 589692 KB Output is correct
71 Correct 264 ms 589720 KB Output is correct
72 Correct 264 ms 589624 KB Output is correct
73 Correct 1618 ms 926284 KB Output is correct
74 Correct 1533 ms 1007864 KB Output is correct
75 Correct 1704 ms 1007480 KB Output is correct
76 Runtime error 978 ms 1048576 KB Execution killed with signal 9
77 Halted 0 ms 0 KB -