oj.uz

Submission #969290

# Submission time Handle Problem Language Result Execution time Memory
969290 2024-04-24T21:58:15 Z NemanjaSo2005 Rectangles (IOI19_rect) C++17
49 / 100
 604 ms 362320 KB 
#include "rect.h"
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn=2505;
ll res=0;
int N,M;
int L[maxn],R[maxn];
stack<int> S;
map<pair<int,int>,int> mapa[maxn];
vector<pair<int,int>> getinterval(vector<int> &V){
   vector<pair<int,int>> res;
   while(S.size())
      S.pop();
   S.push(0);
   L[0]=-1;
   for(int i=1;i<V.size();i++){
      while(S.size()){
         if(V[S.top()]>V[i])
            break;
         S.pop();
      }
      if(S.size()==0)
         L[i]=-1;
      else
         L[i]=S.top()+1;
      S.push(i);
   }
   while(S.size())
      S.pop();


   S.push(V.size()-1);
   for(int i=V.size()-2;i>=1;i--){
      while(S.size()){
         if(V[S.top()]>V[i])
            break;
         S.pop();
      }
      if(S.size()==0)
         R[i]=-1;
      else
         R[i]=S.top()-1;
      S.push(i);
   }

   for(int i=1;i<V.size()-1;i++){
      if(L[i]==-1)
         continue;
      if(R[i]==-1)
         continue;
      res.push_back({L[i],R[i]});
   }
   vector<pair<int,int>> r2;
   if(res.size()){
      sort(res.begin(),res.end());
      r2.push_back(res[0]);
      for(int i=1;i<res.size();i++)
         if(res[i]!=res[i-1])
            r2.push_back(res[i]);
   }
   res.clear();
   res.shrink_to_fit();
   return r2;
}
struct slog{
   int duz,kol;
} pp;
bool poduz(slog a,slog b){
   return a.duz<b.duz;
}
bool pokol(slog a,slog b){
   return a.kol<b.kol;
}
vector<slog> vert[maxn][maxn],hor[maxn][maxn];
int fwt[maxn];
void add(int x,int kol){
   x++;
   for(int i=x;i<=2501;i+=i&-i)
      fwt[i]+=kol;
}
int sum(int x){
   int r=0;
   x++;
   for(int i=x;i>=1;i-=i&-i)
      r+=fwt[i];
   return r;
}
ll resi(vector<slog> &A,vector<slog> &B){
   ll ret=0;
   sort(A.begin(),A.end(),poduz);
   sort(B.begin(),B.end(),pokol);

   for(int i=0;i<B.size();i++)
      add(B[i].duz,1);
   int pok=0;

   for(int i=0;i<A.size();i++){
      while(pok<B.size()){
         if(B[pok].kol>=A[i].duz)
            break;
         add(B[pok].duz,-1);
         pok++;
      }
      ret+=sum(A[i].kol);
   }

   while(pok<B.size()){
      add(B[pok].duz,-1);
      pok++;
   }
/*
   for(slog x:A)
      for(slog y:B){
         if(x.duz>y.kol)
            continue;
         if(y.duz>x.kol)
            continue;
         ret++;
      }*/
   return ret;
}
ll count_rectangles(std::vector<std::vector<int> > inp) {
	N=inp.size();
	M=inp[0].size();


   /// Vertikalni
   for(int i=N-2;i>=1;i--){
      vector<int> V;
      for(int j=0;j<M;j++)
         V.push_back(inp[i][j]);
      auto I = getinterval(V);
      V.clear();
      V.shrink_to_fit();
      for(auto x:I){
         if(mapa[i+1].find(x)!=mapa[i+1].end())
            mapa[i][x]=mapa[i+1][x]+1;
         else
            mapa[i][x]=1;

         pp.kol=mapa[i][x];
         pp.duz=x.second-x.first+1;
         if(N<=700 and M<=700)
         vert[i][x.first].push_back(pp);
      }
   }

   /// Horizontalni

   for(int i=0;i<=M;i++)
      mapa[i].clear();
   for(int i=M-2;i>=1;i--){
      vector<int> V;
      for(int j=0;j<N;j++)
         V.push_back(inp[j][i]);
      auto I = getinterval(V);
      V.clear();
      V.shrink_to_fit();
      for(auto x:I){
         if(mapa[i+1].find(x)!=mapa[i+1].end())
            mapa[i][x]=mapa[i+1][x]+1;
         else
            mapa[i][x]=1;

         pp.kol=mapa[i][x];
         pp.duz=x.second-x.first+1;
         if(N<=700 and M<=700)
         hor[x.first][i].push_back(pp);
      }
   }
   for(int i=0;i<=M;i++)
      mapa[i].clear();

   ll res=0;
   for(int i=1;i<=N-2;i++)
      for(int j=1;j<=M-2;j++){
       //  cout<<i<<" "<<j<<endl;
         res+=resi(vert[i][j],hor[i][j]);
      }

   return res;
}

Compilation message

rect.cpp: In function 'std::vector<std::pair<int, int> > getinterval(std::vector<int>&)':
rect.cpp:17:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |    for(int i=1;i<V.size();i++){
      |                ~^~~~~~~~~
rect.cpp:47:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |    for(int i=1;i<V.size()-1;i++){
      |                ~^~~~~~~~~~~
rect.cpp:58:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |       for(int i=1;i<res.size();i++)
      |                   ~^~~~~~~~~~~
rect.cpp: In function 'long long int resi(std::vector<slog>&, std::vector<slog>&)':
rect.cpp:94:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<slog>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   94 |    for(int i=0;i<B.size();i++)
      |                ~^~~~~~~~~
rect.cpp:98:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<slog>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   98 |    for(int i=0;i<A.size();i++){
      |                ~^~~~~~~~~
rect.cpp:99:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<slog>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |       while(pok<B.size()){
      |             ~~~^~~~~~~~~
rect.cpp:108:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<slog>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  108 |    while(pok<B.size()){
      |          ~~~^~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 143 ms 295156 KB Output is correct
2 Correct 138 ms 295124 KB Output is correct
3 Correct 108 ms 295252 KB Output is correct
4 Correct 108 ms 295248 KB Output is correct
5 Correct 108 ms 295248 KB Output is correct
6 Correct 109 ms 295252 KB Output is correct
7 Correct 108 ms 295128 KB Output is correct
8 Correct 107 ms 295256 KB Output is correct
9 Correct 108 ms 295248 KB Output is correct
10 Correct 117 ms 295340 KB Output is correct
11 Correct 111 ms 295244 KB Output is correct
12 Correct 107 ms 295252 KB Output is correct
13 Correct 107 ms 295164 KB Output is correct
14 Correct 106 ms 295252 KB Output is correct
15 Correct 109 ms 295248 KB Output is correct
16 Correct 107 ms 295052 KB Output is correct
17 Correct 108 ms 295184 KB Output is correct
18 Correct 108 ms 295092 KB Output is correct
19 Correct 108 ms 295112 KB Output is correct
20 Correct 108 ms 295096 KB Output is correct
21 Correct 107 ms 295068 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 143 ms 295156 KB Output is correct
2 Correct 138 ms 295124 KB Output is correct
3 Correct 108 ms 295252 KB Output is correct
4 Correct 108 ms 295248 KB Output is correct
5 Correct 108 ms 295248 KB Output is correct
6 Correct 109 ms 295252 KB Output is correct
7 Correct 108 ms 295128 KB Output is correct
8 Correct 107 ms 295256 KB Output is correct
9 Correct 108 ms 295248 KB Output is correct
10 Correct 117 ms 295340 KB Output is correct
11 Correct 111 ms 295244 KB Output is correct
12 Correct 107 ms 295252 KB Output is correct
13 Correct 107 ms 295164 KB Output is correct
14 Correct 106 ms 295252 KB Output is correct
15 Correct 109 ms 295248 KB Output is correct
16 Correct 107 ms 295052 KB Output is correct
17 Correct 108 ms 295184 KB Output is correct
18 Correct 108 ms 295092 KB Output is correct
19 Correct 108 ms 295112 KB Output is correct
20 Correct 108 ms 295096 KB Output is correct
21 Correct 107 ms 295068 KB Output is correct
22 Correct 109 ms 295968 KB Output is correct
23 Correct 113 ms 296020 KB Output is correct
24 Correct 110 ms 296016 KB Output is correct
25 Correct 108 ms 295504 KB Output is correct
26 Correct 111 ms 295736 KB Output is correct
27 Correct 113 ms 295760 KB Output is correct
28 Correct 110 ms 295764 KB Output is correct
29 Correct 108 ms 295524 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 143 ms 295156 KB Output is correct
2 Correct 138 ms 295124 KB Output is correct
3 Correct 108 ms 295252 KB Output is correct
4 Correct 108 ms 295248 KB Output is correct
5 Correct 108 ms 295248 KB Output is correct
6 Correct 109 ms 295252 KB Output is correct
7 Correct 108 ms 295128 KB Output is correct
8 Correct 107 ms 295256 KB Output is correct
9 Correct 108 ms 295248 KB Output is correct
10 Correct 117 ms 295340 KB Output is correct
11 Correct 111 ms 295244 KB Output is correct
12 Correct 107 ms 295252 KB Output is correct
13 Correct 107 ms 295164 KB Output is correct
14 Correct 106 ms 295252 KB Output is correct
15 Correct 109 ms 295248 KB Output is correct
16 Correct 107 ms 295052 KB Output is correct
17 Correct 109 ms 295968 KB Output is correct
18 Correct 113 ms 296020 KB Output is correct
19 Correct 110 ms 296016 KB Output is correct
20 Correct 108 ms 295504 KB Output is correct
21 Correct 111 ms 295736 KB Output is correct
22 Correct 113 ms 295760 KB Output is correct
23 Correct 110 ms 295764 KB Output is correct
24 Correct 108 ms 295524 KB Output is correct
25 Correct 108 ms 295184 KB Output is correct
26 Correct 108 ms 295092 KB Output is correct
27 Correct 108 ms 295112 KB Output is correct
28 Correct 108 ms 295096 KB Output is correct
29 Correct 107 ms 295068 KB Output is correct
30 Correct 128 ms 300368 KB Output is correct
31 Correct 133 ms 300628 KB Output is correct
32 Correct 128 ms 300356 KB Output is correct
33 Correct 119 ms 297296 KB Output is correct
34 Correct 137 ms 299132 KB Output is correct
35 Correct 137 ms 299328 KB Output is correct
36 Correct 134 ms 299092 KB Output is correct
37 Correct 135 ms 298832 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 143 ms 295156 KB Output is correct
2 Correct 138 ms 295124 KB Output is correct
3 Correct 108 ms 295252 KB Output is correct
4 Correct 108 ms 295248 KB Output is correct
5 Correct 108 ms 295248 KB Output is correct
6 Correct 109 ms 295252 KB Output is correct
7 Correct 108 ms 295128 KB Output is correct
8 Correct 107 ms 295256 KB Output is correct
9 Correct 108 ms 295248 KB Output is correct
10 Correct 117 ms 295340 KB Output is correct
11 Correct 111 ms 295244 KB Output is correct
12 Correct 107 ms 295252 KB Output is correct
13 Correct 107 ms 295164 KB Output is correct
14 Correct 106 ms 295252 KB Output is correct
15 Correct 109 ms 295248 KB Output is correct
16 Correct 107 ms 295052 KB Output is correct
17 Correct 109 ms 295968 KB Output is correct
18 Correct 113 ms 296020 KB Output is correct
19 Correct 110 ms 296016 KB Output is correct
20 Correct 108 ms 295504 KB Output is correct
21 Correct 111 ms 295736 KB Output is correct
22 Correct 113 ms 295760 KB Output is correct
23 Correct 110 ms 295764 KB Output is correct
24 Correct 108 ms 295524 KB Output is correct
25 Correct 128 ms 300368 KB Output is correct
26 Correct 133 ms 300628 KB Output is correct
27 Correct 128 ms 300356 KB Output is correct
28 Correct 119 ms 297296 KB Output is correct
29 Correct 137 ms 299132 KB Output is correct
30 Correct 137 ms 299328 KB Output is correct
31 Correct 134 ms 299092 KB Output is correct
32 Correct 135 ms 298832 KB Output is correct
33 Correct 108 ms 295184 KB Output is correct
34 Correct 108 ms 295092 KB Output is correct
35 Correct 108 ms 295112 KB Output is correct
36 Correct 108 ms 295096 KB Output is correct
37 Correct 107 ms 295068 KB Output is correct
38 Correct 285 ms 329588 KB Output is correct
39 Correct 273 ms 324948 KB Output is correct
40 Correct 244 ms 325172 KB Output is correct
41 Correct 234 ms 320084 KB Output is correct
42 Correct 484 ms 360016 KB Output is correct
43 Correct 490 ms 360108 KB Output is correct
44 Correct 489 ms 360204 KB Output is correct
45 Correct 457 ms 355912 KB Output is correct
46 Correct 237 ms 314180 KB Output is correct
47 Correct 302 ms 321084 KB Output is correct
48 Correct 559 ms 347028 KB Output is correct
49 Correct 568 ms 347476 KB Output is correct
50 Correct 304 ms 328528 KB Output is correct
51 Correct 328 ms 321172 KB Output is correct
52 Correct 536 ms 343624 KB Output is correct
53 Correct 537 ms 343844 KB Output is correct

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 106 ms 295484 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 295184 KB Output is correct
2 Correct 108 ms 295092 KB Output is correct
3 Correct 108 ms 295112 KB Output is correct
4 Correct 108 ms 295096 KB Output is correct
5 Correct 107 ms 295068 KB Output is correct
6 Correct 108 ms 295224 KB Output is correct
7 Incorrect 604 ms 362320 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 143 ms 295156 KB Output is correct
2 Correct 138 ms 295124 KB Output is correct
3 Correct 108 ms 295252 KB Output is correct
4 Correct 108 ms 295248 KB Output is correct
5 Correct 108 ms 295248 KB Output is correct
6 Correct 109 ms 295252 KB Output is correct
7 Correct 108 ms 295128 KB Output is correct
8 Correct 107 ms 295256 KB Output is correct
9 Correct 108 ms 295248 KB Output is correct
10 Correct 117 ms 295340 KB Output is correct
11 Correct 111 ms 295244 KB Output is correct
12 Correct 107 ms 295252 KB Output is correct
13 Correct 107 ms 295164 KB Output is correct
14 Correct 106 ms 295252 KB Output is correct
15 Correct 109 ms 295248 KB Output is correct
16 Correct 107 ms 295052 KB Output is correct
17 Correct 109 ms 295968 KB Output is correct
18 Correct 113 ms 296020 KB Output is correct
19 Correct 110 ms 296016 KB Output is correct
20 Correct 108 ms 295504 KB Output is correct
21 Correct 111 ms 295736 KB Output is correct
22 Correct 113 ms 295760 KB Output is correct
23 Correct 110 ms 295764 KB Output is correct
24 Correct 108 ms 295524 KB Output is correct
25 Correct 128 ms 300368 KB Output is correct
26 Correct 133 ms 300628 KB Output is correct
27 Correct 128 ms 300356 KB Output is correct
28 Correct 119 ms 297296 KB Output is correct
29 Correct 137 ms 299132 KB Output is correct
30 Correct 137 ms 299328 KB Output is correct
31 Correct 134 ms 299092 KB Output is correct
32 Correct 135 ms 298832 KB Output is correct
33 Correct 285 ms 329588 KB Output is correct
34 Correct 273 ms 324948 KB Output is correct
35 Correct 244 ms 325172 KB Output is correct
36 Correct 234 ms 320084 KB Output is correct
37 Correct 484 ms 360016 KB Output is correct
38 Correct 490 ms 360108 KB Output is correct
39 Correct 489 ms 360204 KB Output is correct
40 Correct 457 ms 355912 KB Output is correct
41 Correct 237 ms 314180 KB Output is correct
42 Correct 302 ms 321084 KB Output is correct
43 Correct 559 ms 347028 KB Output is correct
44 Correct 568 ms 347476 KB Output is correct
45 Correct 304 ms 328528 KB Output is correct
46 Correct 328 ms 321172 KB Output is correct
47 Correct 536 ms 343624 KB Output is correct
48 Correct 537 ms 343844 KB Output is correct
49 Incorrect 106 ms 295484 KB Output isn't correct
50 Halted 0 ms 0 KB -