oj.uz

Submission #969296

# Submission time Handle Problem Language Result Execution time Memory
969296 2024-04-24T22:22:27 Z NemanjaSo2005 Rectangles (IOI19_rect) C++17
72 / 100
 5000 ms 784168 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];
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;
}
int resi(vector<slog> &A,vector<slog> &B){
   int ret=0;
   swap(A,B);
   //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++;
   }
   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;

         vert[i][x.first].push_back(pp);
      }
   }

   /// Horizontalni

   ll res=0;

   for(int i=0;i<=M;i++)
      mapa[i].clear();
   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);
      if(I.size()==0)
         continue;
      vector<slog> PV;
      V.clear();
      V.shrink_to_fit();
      int px=I[0].first;
      for(auto x:I){
         if(x.first!=px){
            res+=resi(vert[px][i],PV);
            px=x.first;
            PV.clear();
         }

         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;
         PV.push_back(pp);
      }
      res+=resi(vert[px][i],PV);
   }

   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 'int resi(std::vector<slog>&, std::vector<slog>&)':
rect.cpp:95:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<slog>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   95 |    for(int i=0;i<B.size();i++)
      |                ~^~~~~~~~~
rect.cpp:99:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<slog>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |    for(int i=0;i<A.size();i++){
      |                ~^~~~~~~~~
rect.cpp:100:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<slog>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  100 |       while(pok<B.size()){
      |             ~~~^~~~~~~~~
rect.cpp:109:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<slog>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  109 |    while(pok<B.size()){
      |          ~~~^~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 147792 KB Output is correct
2 Correct 44 ms 147792 KB Output is correct
3 Correct 58 ms 147808 KB Output is correct
4 Correct 44 ms 147792 KB Output is correct
5 Correct 44 ms 147792 KB Output is correct
6 Correct 44 ms 147792 KB Output is correct
7 Correct 45 ms 147792 KB Output is correct
8 Correct 48 ms 147804 KB Output is correct
9 Correct 45 ms 147792 KB Output is correct
10 Correct 50 ms 147800 KB Output is correct
11 Correct 44 ms 147792 KB Output is correct
12 Correct 43 ms 147768 KB Output is correct
13 Correct 43 ms 147792 KB Output is correct
14 Correct 43 ms 147800 KB Output is correct
15 Correct 44 ms 147788 KB Output is correct
16 Correct 45 ms 147792 KB Output is correct
17 Correct 43 ms 147792 KB Output is correct
18 Correct 43 ms 147800 KB Output is correct
19 Correct 44 ms 147804 KB Output is correct
20 Correct 45 ms 147720 KB Output is correct
21 Correct 44 ms 147800 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 147792 KB Output is correct
2 Correct 44 ms 147792 KB Output is correct
3 Correct 58 ms 147808 KB Output is correct
4 Correct 44 ms 147792 KB Output is correct
5 Correct 44 ms 147792 KB Output is correct
6 Correct 44 ms 147792 KB Output is correct
7 Correct 45 ms 147792 KB Output is correct
8 Correct 48 ms 147804 KB Output is correct
9 Correct 45 ms 147792 KB Output is correct
10 Correct 50 ms 147800 KB Output is correct
11 Correct 44 ms 147792 KB Output is correct
12 Correct 43 ms 147768 KB Output is correct
13 Correct 43 ms 147792 KB Output is correct
14 Correct 43 ms 147800 KB Output is correct
15 Correct 44 ms 147788 KB Output is correct
16 Correct 45 ms 147792 KB Output is correct
17 Correct 43 ms 147792 KB Output is correct
18 Correct 43 ms 147800 KB Output is correct
19 Correct 44 ms 147804 KB Output is correct
20 Correct 45 ms 147720 KB Output is correct
21 Correct 44 ms 147800 KB Output is correct
22 Correct 44 ms 148312 KB Output is correct
23 Correct 47 ms 148304 KB Output is correct
24 Correct 46 ms 148304 KB Output is correct
25 Correct 47 ms 148056 KB Output is correct
26 Correct 63 ms 148308 KB Output is correct
27 Correct 54 ms 148224 KB Output is correct
28 Correct 48 ms 148308 KB Output is correct
29 Correct 46 ms 148048 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 147792 KB Output is correct
2 Correct 44 ms 147792 KB Output is correct
3 Correct 58 ms 147808 KB Output is correct
4 Correct 44 ms 147792 KB Output is correct
5 Correct 44 ms 147792 KB Output is correct
6 Correct 44 ms 147792 KB Output is correct
7 Correct 45 ms 147792 KB Output is correct
8 Correct 48 ms 147804 KB Output is correct
9 Correct 45 ms 147792 KB Output is correct
10 Correct 50 ms 147800 KB Output is correct
11 Correct 44 ms 147792 KB Output is correct
12 Correct 43 ms 147768 KB Output is correct
13 Correct 43 ms 147792 KB Output is correct
14 Correct 43 ms 147800 KB Output is correct
15 Correct 44 ms 147788 KB Output is correct
16 Correct 45 ms 147792 KB Output is correct
17 Correct 44 ms 148312 KB Output is correct
18 Correct 47 ms 148304 KB Output is correct
19 Correct 46 ms 148304 KB Output is correct
20 Correct 47 ms 148056 KB Output is correct
21 Correct 63 ms 148308 KB Output is correct
22 Correct 54 ms 148224 KB Output is correct
23 Correct 48 ms 148308 KB Output is correct
24 Correct 46 ms 148048 KB Output is correct
25 Correct 43 ms 147792 KB Output is correct
26 Correct 43 ms 147800 KB Output is correct
27 Correct 44 ms 147804 KB Output is correct
28 Correct 45 ms 147720 KB Output is correct
29 Correct 44 ms 147800 KB Output is correct
30 Correct 61 ms 151888 KB Output is correct
31 Correct 63 ms 151888 KB Output is correct
32 Correct 63 ms 151932 KB Output is correct
33 Correct 55 ms 149568 KB Output is correct
34 Correct 67 ms 151376 KB Output is correct
35 Correct 77 ms 151608 KB Output is correct
36 Correct 69 ms 151300 KB Output is correct
37 Correct 67 ms 151120 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 147792 KB Output is correct
2 Correct 44 ms 147792 KB Output is correct
3 Correct 58 ms 147808 KB Output is correct
4 Correct 44 ms 147792 KB Output is correct
5 Correct 44 ms 147792 KB Output is correct
6 Correct 44 ms 147792 KB Output is correct
7 Correct 45 ms 147792 KB Output is correct
8 Correct 48 ms 147804 KB Output is correct
9 Correct 45 ms 147792 KB Output is correct
10 Correct 50 ms 147800 KB Output is correct
11 Correct 44 ms 147792 KB Output is correct
12 Correct 43 ms 147768 KB Output is correct
13 Correct 43 ms 147792 KB Output is correct
14 Correct 43 ms 147800 KB Output is correct
15 Correct 44 ms 147788 KB Output is correct
16 Correct 45 ms 147792 KB Output is correct
17 Correct 44 ms 148312 KB Output is correct
18 Correct 47 ms 148304 KB Output is correct
19 Correct 46 ms 148304 KB Output is correct
20 Correct 47 ms 148056 KB Output is correct
21 Correct 63 ms 148308 KB Output is correct
22 Correct 54 ms 148224 KB Output is correct
23 Correct 48 ms 148308 KB Output is correct
24 Correct 46 ms 148048 KB Output is correct
25 Correct 61 ms 151888 KB Output is correct
26 Correct 63 ms 151888 KB Output is correct
27 Correct 63 ms 151932 KB Output is correct
28 Correct 55 ms 149568 KB Output is correct
29 Correct 67 ms 151376 KB Output is correct
30 Correct 77 ms 151608 KB Output is correct
31 Correct 69 ms 151300 KB Output is correct
32 Correct 67 ms 151120 KB Output is correct
33 Correct 43 ms 147792 KB Output is correct
34 Correct 43 ms 147800 KB Output is correct
35 Correct 44 ms 147804 KB Output is correct
36 Correct 45 ms 147720 KB Output is correct
37 Correct 44 ms 147800 KB Output is correct
38 Correct 200 ms 182352 KB Output is correct
39 Correct 191 ms 174680 KB Output is correct
40 Correct 164 ms 177548 KB Output is correct
41 Correct 159 ms 169816 KB Output is correct
42 Correct 407 ms 197456 KB Output is correct
43 Correct 413 ms 197460 KB Output is correct
44 Correct 406 ms 197460 KB Output is correct
45 Correct 376 ms 194132 KB Output is correct
46 Correct 162 ms 164996 KB Output is correct
47 Correct 230 ms 170772 KB Output is correct
48 Correct 470 ms 194336 KB Output is correct
49 Correct 464 ms 194948 KB Output is correct
50 Correct 234 ms 178516 KB Output is correct
51 Correct 244 ms 171132 KB Output is correct
52 Correct 441 ms 191572 KB Output is correct
53 Correct 456 ms 191528 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 148060 KB Output is correct
2 Correct 44 ms 148048 KB Output is correct
3 Correct 44 ms 147796 KB Output is correct
4 Correct 44 ms 147804 KB Output is correct
5 Correct 45 ms 148052 KB Output is correct
6 Correct 48 ms 148056 KB Output is correct
7 Correct 45 ms 148144 KB Output is correct
8 Correct 46 ms 148048 KB Output is correct
9 Correct 52 ms 148044 KB Output is correct
10 Correct 44 ms 147792 KB Output is correct
11 Correct 44 ms 147992 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 147792 KB Output is correct
2 Correct 43 ms 147800 KB Output is correct
3 Correct 44 ms 147804 KB Output is correct
4 Correct 45 ms 147720 KB Output is correct
5 Correct 44 ms 147800 KB Output is correct
6 Correct 44 ms 147796 KB Output is correct
7 Correct 812 ms 248768 KB Output is correct
8 Correct 1766 ms 366556 KB Output is correct
9 Correct 1789 ms 367764 KB Output is correct
10 Correct 1764 ms 367648 KB Output is correct
11 Correct 142 ms 172112 KB Output is correct
12 Correct 264 ms 193872 KB Output is correct
13 Correct 270 ms 197084 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 147792 KB Output is correct
2 Correct 44 ms 147792 KB Output is correct
3 Correct 58 ms 147808 KB Output is correct
4 Correct 44 ms 147792 KB Output is correct
5 Correct 44 ms 147792 KB Output is correct
6 Correct 44 ms 147792 KB Output is correct
7 Correct 45 ms 147792 KB Output is correct
8 Correct 48 ms 147804 KB Output is correct
9 Correct 45 ms 147792 KB Output is correct
10 Correct 50 ms 147800 KB Output is correct
11 Correct 44 ms 147792 KB Output is correct
12 Correct 43 ms 147768 KB Output is correct
13 Correct 43 ms 147792 KB Output is correct
14 Correct 43 ms 147800 KB Output is correct
15 Correct 44 ms 147788 KB Output is correct
16 Correct 45 ms 147792 KB Output is correct
17 Correct 44 ms 148312 KB Output is correct
18 Correct 47 ms 148304 KB Output is correct
19 Correct 46 ms 148304 KB Output is correct
20 Correct 47 ms 148056 KB Output is correct
21 Correct 63 ms 148308 KB Output is correct
22 Correct 54 ms 148224 KB Output is correct
23 Correct 48 ms 148308 KB Output is correct
24 Correct 46 ms 148048 KB Output is correct
25 Correct 61 ms 151888 KB Output is correct
26 Correct 63 ms 151888 KB Output is correct
27 Correct 63 ms 151932 KB Output is correct
28 Correct 55 ms 149568 KB Output is correct
29 Correct 67 ms 151376 KB Output is correct
30 Correct 77 ms 151608 KB Output is correct
31 Correct 69 ms 151300 KB Output is correct
32 Correct 67 ms 151120 KB Output is correct
33 Correct 200 ms 182352 KB Output is correct
34 Correct 191 ms 174680 KB Output is correct
35 Correct 164 ms 177548 KB Output is correct
36 Correct 159 ms 169816 KB Output is correct
37 Correct 407 ms 197456 KB Output is correct
38 Correct 413 ms 197460 KB Output is correct
39 Correct 406 ms 197460 KB Output is correct
40 Correct 376 ms 194132 KB Output is correct
41 Correct 162 ms 164996 KB Output is correct
42 Correct 230 ms 170772 KB Output is correct
43 Correct 470 ms 194336 KB Output is correct
44 Correct 464 ms 194948 KB Output is correct
45 Correct 234 ms 178516 KB Output is correct
46 Correct 244 ms 171132 KB Output is correct
47 Correct 441 ms 191572 KB Output is correct
48 Correct 456 ms 191528 KB Output is correct
49 Correct 45 ms 148060 KB Output is correct
50 Correct 44 ms 148048 KB Output is correct
51 Correct 44 ms 147796 KB Output is correct
52 Correct 44 ms 147804 KB Output is correct
53 Correct 45 ms 148052 KB Output is correct
54 Correct 48 ms 148056 KB Output is correct
55 Correct 45 ms 148144 KB Output is correct
56 Correct 46 ms 148048 KB Output is correct
57 Correct 52 ms 148044 KB Output is correct
58 Correct 44 ms 147792 KB Output is correct
59 Correct 44 ms 147992 KB Output is correct
60 Correct 44 ms 147796 KB Output is correct
61 Correct 812 ms 248768 KB Output is correct
62 Correct 1766 ms 366556 KB Output is correct
63 Correct 1789 ms 367764 KB Output is correct
64 Correct 1764 ms 367648 KB Output is correct
65 Correct 142 ms 172112 KB Output is correct
66 Correct 264 ms 193872 KB Output is correct
67 Correct 270 ms 197084 KB Output is correct
68 Correct 43 ms 147792 KB Output is correct
69 Correct 43 ms 147800 KB Output is correct
70 Correct 44 ms 147804 KB Output is correct
71 Correct 45 ms 147720 KB Output is correct
72 Correct 44 ms 147800 KB Output is correct
73 Correct 2286 ms 588092 KB Output is correct
74 Correct 2178 ms 490264 KB Output is correct
75 Correct 1752 ms 521560 KB Output is correct
76 Correct 1647 ms 429280 KB Output is correct
77 Execution timed out 5070 ms 784168 KB Time limit exceeded
78 Halted 0 ms 0 KB -