oj.uz

Submission #969287

# Submission time Handle Problem Language Result Execution time Memory
969287 2024-04-24T21:49:53 Z NemanjaSo2005 Rectangles (IOI19_rect) C++17
72 / 100
 3956 ms 1048576 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,mat[maxn][maxn];
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]);
   }
   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();
   for(int i=0;i<N;i++)
      for(int j=0;j<M;j++)
         mat[i][j]=inp[i][j];


   /// Vertikalni
   for(int i=N-2;i>=1;i--){
      vector<int> V;
      for(int j=0;j<M;j++)
         V.push_back(mat[i][j]);
      auto I = getinterval(V);
      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

   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(mat[j][i]);
      auto I = getinterval(V);
      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;
         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:92:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<slog>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |    for(int i=0;i<B.size();i++)
      |                ~^~~~~~~~~
rect.cpp:96:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<slog>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   96 |    for(int i=0;i<A.size();i++){
      |                ~^~~~~~~~~
rect.cpp:97:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<slog>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   97 |       while(pok<B.size()){
      |             ~~~^~~~~~~~~
rect.cpp:106:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<slog>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  106 |    while(pok<B.size()){
      |          ~~~^~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 145 ms 296024 KB Output is correct
2 Correct 111 ms 296172 KB Output is correct
3 Correct 110 ms 296020 KB Output is correct
4 Correct 109 ms 296064 KB Output is correct
5 Correct 110 ms 295940 KB Output is correct
6 Correct 110 ms 296040 KB Output is correct
7 Correct 111 ms 296016 KB Output is correct
8 Correct 110 ms 296016 KB Output is correct
9 Correct 107 ms 296016 KB Output is correct
10 Correct 110 ms 296016 KB Output is correct
11 Correct 115 ms 296016 KB Output is correct
12 Correct 107 ms 296016 KB Output is correct
13 Correct 108 ms 296016 KB Output is correct
14 Correct 108 ms 296020 KB Output is correct
15 Correct 107 ms 296024 KB Output is correct
16 Correct 108 ms 296048 KB Output is correct
17 Correct 108 ms 296016 KB Output is correct
18 Correct 136 ms 295868 KB Output is correct
19 Correct 110 ms 295868 KB Output is correct
20 Correct 138 ms 296020 KB Output is correct
21 Correct 110 ms 295816 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 145 ms 296024 KB Output is correct
2 Correct 111 ms 296172 KB Output is correct
3 Correct 110 ms 296020 KB Output is correct
4 Correct 109 ms 296064 KB Output is correct
5 Correct 110 ms 295940 KB Output is correct
6 Correct 110 ms 296040 KB Output is correct
7 Correct 111 ms 296016 KB Output is correct
8 Correct 110 ms 296016 KB Output is correct
9 Correct 107 ms 296016 KB Output is correct
10 Correct 110 ms 296016 KB Output is correct
11 Correct 115 ms 296016 KB Output is correct
12 Correct 107 ms 296016 KB Output is correct
13 Correct 108 ms 296016 KB Output is correct
14 Correct 108 ms 296020 KB Output is correct
15 Correct 107 ms 296024 KB Output is correct
16 Correct 108 ms 296048 KB Output is correct
17 Correct 108 ms 296016 KB Output is correct
18 Correct 136 ms 295868 KB Output is correct
19 Correct 110 ms 295868 KB Output is correct
20 Correct 138 ms 296020 KB Output is correct
21 Correct 110 ms 295816 KB Output is correct
22 Correct 163 ms 296660 KB Output is correct
23 Correct 115 ms 296980 KB Output is correct
24 Correct 123 ms 296788 KB Output is correct
25 Correct 112 ms 296276 KB Output is correct
26 Correct 111 ms 296532 KB Output is correct
27 Correct 121 ms 296596 KB Output is correct
28 Correct 119 ms 296540 KB Output is correct
29 Correct 109 ms 296272 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 145 ms 296024 KB Output is correct
2 Correct 111 ms 296172 KB Output is correct
3 Correct 110 ms 296020 KB Output is correct
4 Correct 109 ms 296064 KB Output is correct
5 Correct 110 ms 295940 KB Output is correct
6 Correct 110 ms 296040 KB Output is correct
7 Correct 111 ms 296016 KB Output is correct
8 Correct 110 ms 296016 KB Output is correct
9 Correct 107 ms 296016 KB Output is correct
10 Correct 110 ms 296016 KB Output is correct
11 Correct 115 ms 296016 KB Output is correct
12 Correct 107 ms 296016 KB Output is correct
13 Correct 108 ms 296016 KB Output is correct
14 Correct 108 ms 296020 KB Output is correct
15 Correct 107 ms 296024 KB Output is correct
16 Correct 108 ms 296048 KB Output is correct
17 Correct 163 ms 296660 KB Output is correct
18 Correct 115 ms 296980 KB Output is correct
19 Correct 123 ms 296788 KB Output is correct
20 Correct 112 ms 296276 KB Output is correct
21 Correct 111 ms 296532 KB Output is correct
22 Correct 121 ms 296596 KB Output is correct
23 Correct 119 ms 296540 KB Output is correct
24 Correct 109 ms 296272 KB Output is correct
25 Correct 108 ms 296016 KB Output is correct
26 Correct 136 ms 295868 KB Output is correct
27 Correct 110 ms 295868 KB Output is correct
28 Correct 138 ms 296020 KB Output is correct
29 Correct 110 ms 295816 KB Output is correct
30 Correct 127 ms 301652 KB Output is correct
31 Correct 131 ms 301652 KB Output is correct
32 Correct 128 ms 301648 KB Output is correct
33 Correct 119 ms 298624 KB Output is correct
34 Correct 140 ms 300628 KB Output is correct
35 Correct 152 ms 300824 KB Output is correct
36 Correct 135 ms 300372 KB Output is correct
37 Correct 134 ms 300368 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 145 ms 296024 KB Output is correct
2 Correct 111 ms 296172 KB Output is correct
3 Correct 110 ms 296020 KB Output is correct
4 Correct 109 ms 296064 KB Output is correct
5 Correct 110 ms 295940 KB Output is correct
6 Correct 110 ms 296040 KB Output is correct
7 Correct 111 ms 296016 KB Output is correct
8 Correct 110 ms 296016 KB Output is correct
9 Correct 107 ms 296016 KB Output is correct
10 Correct 110 ms 296016 KB Output is correct
11 Correct 115 ms 296016 KB Output is correct
12 Correct 107 ms 296016 KB Output is correct
13 Correct 108 ms 296016 KB Output is correct
14 Correct 108 ms 296020 KB Output is correct
15 Correct 107 ms 296024 KB Output is correct
16 Correct 108 ms 296048 KB Output is correct
17 Correct 163 ms 296660 KB Output is correct
18 Correct 115 ms 296980 KB Output is correct
19 Correct 123 ms 296788 KB Output is correct
20 Correct 112 ms 296276 KB Output is correct
21 Correct 111 ms 296532 KB Output is correct
22 Correct 121 ms 296596 KB Output is correct
23 Correct 119 ms 296540 KB Output is correct
24 Correct 109 ms 296272 KB Output is correct
25 Correct 127 ms 301652 KB Output is correct
26 Correct 131 ms 301652 KB Output is correct
27 Correct 128 ms 301648 KB Output is correct
28 Correct 119 ms 298624 KB Output is correct
29 Correct 140 ms 300628 KB Output is correct
30 Correct 152 ms 300824 KB Output is correct
31 Correct 135 ms 300372 KB Output is correct
32 Correct 134 ms 300368 KB Output is correct
33 Correct 108 ms 296016 KB Output is correct
34 Correct 136 ms 295868 KB Output is correct
35 Correct 110 ms 295868 KB Output is correct
36 Correct 138 ms 296020 KB Output is correct
37 Correct 110 ms 295816 KB Output is correct
38 Correct 325 ms 334676 KB Output is correct
39 Correct 276 ms 329808 KB Output is correct
40 Correct 281 ms 330064 KB Output is correct
41 Correct 231 ms 325204 KB Output is correct
42 Correct 493 ms 364952 KB Output is correct
43 Correct 516 ms 364984 KB Output is correct
44 Correct 498 ms 365096 KB Output is correct
45 Correct 494 ms 360428 KB Output is correct
46 Correct 239 ms 319312 KB Output is correct
47 Correct 296 ms 325976 KB Output is correct
48 Correct 565 ms 352012 KB Output is correct
49 Correct 590 ms 352440 KB Output is correct
50 Correct 350 ms 332612 KB Output is correct
51 Correct 322 ms 323668 KB Output is correct
52 Correct 550 ms 348604 KB Output is correct
53 Correct 579 ms 348732 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 296408 KB Output is correct
2 Correct 110 ms 296188 KB Output is correct
3 Correct 114 ms 296024 KB Output is correct
4 Correct 108 ms 296020 KB Output is correct
5 Correct 109 ms 296200 KB Output is correct
6 Correct 114 ms 296168 KB Output is correct
7 Correct 110 ms 296300 KB Output is correct
8 Correct 109 ms 296348 KB Output is correct
9 Correct 108 ms 296272 KB Output is correct
10 Correct 129 ms 296072 KB Output is correct
11 Correct 108 ms 296016 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 296016 KB Output is correct
2 Correct 136 ms 295868 KB Output is correct
3 Correct 110 ms 295868 KB Output is correct
4 Correct 138 ms 296020 KB Output is correct
5 Correct 110 ms 295816 KB Output is correct
6 Correct 106 ms 295996 KB Output is correct
7 Correct 943 ms 419152 KB Output is correct
8 Correct 2003 ms 562964 KB Output is correct
9 Correct 2013 ms 564348 KB Output is correct
10 Correct 1993 ms 564132 KB Output is correct
11 Correct 222 ms 331604 KB Output is correct
12 Correct 371 ms 365876 KB Output is correct
13 Correct 360 ms 368720 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 145 ms 296024 KB Output is correct
2 Correct 111 ms 296172 KB Output is correct
3 Correct 110 ms 296020 KB Output is correct
4 Correct 109 ms 296064 KB Output is correct
5 Correct 110 ms 295940 KB Output is correct
6 Correct 110 ms 296040 KB Output is correct
7 Correct 111 ms 296016 KB Output is correct
8 Correct 110 ms 296016 KB Output is correct
9 Correct 107 ms 296016 KB Output is correct
10 Correct 110 ms 296016 KB Output is correct
11 Correct 115 ms 296016 KB Output is correct
12 Correct 107 ms 296016 KB Output is correct
13 Correct 108 ms 296016 KB Output is correct
14 Correct 108 ms 296020 KB Output is correct
15 Correct 107 ms 296024 KB Output is correct
16 Correct 108 ms 296048 KB Output is correct
17 Correct 163 ms 296660 KB Output is correct
18 Correct 115 ms 296980 KB Output is correct
19 Correct 123 ms 296788 KB Output is correct
20 Correct 112 ms 296276 KB Output is correct
21 Correct 111 ms 296532 KB Output is correct
22 Correct 121 ms 296596 KB Output is correct
23 Correct 119 ms 296540 KB Output is correct
24 Correct 109 ms 296272 KB Output is correct
25 Correct 127 ms 301652 KB Output is correct
26 Correct 131 ms 301652 KB Output is correct
27 Correct 128 ms 301648 KB Output is correct
28 Correct 119 ms 298624 KB Output is correct
29 Correct 140 ms 300628 KB Output is correct
30 Correct 152 ms 300824 KB Output is correct
31 Correct 135 ms 300372 KB Output is correct
32 Correct 134 ms 300368 KB Output is correct
33 Correct 325 ms 334676 KB Output is correct
34 Correct 276 ms 329808 KB Output is correct
35 Correct 281 ms 330064 KB Output is correct
36 Correct 231 ms 325204 KB Output is correct
37 Correct 493 ms 364952 KB Output is correct
38 Correct 516 ms 364984 KB Output is correct
39 Correct 498 ms 365096 KB Output is correct
40 Correct 494 ms 360428 KB Output is correct
41 Correct 239 ms 319312 KB Output is correct
42 Correct 296 ms 325976 KB Output is correct
43 Correct 565 ms 352012 KB Output is correct
44 Correct 590 ms 352440 KB Output is correct
45 Correct 350 ms 332612 KB Output is correct
46 Correct 322 ms 323668 KB Output is correct
47 Correct 550 ms 348604 KB Output is correct
48 Correct 579 ms 348732 KB Output is correct
49 Correct 107 ms 296408 KB Output is correct
50 Correct 110 ms 296188 KB Output is correct
51 Correct 114 ms 296024 KB Output is correct
52 Correct 108 ms 296020 KB Output is correct
53 Correct 109 ms 296200 KB Output is correct
54 Correct 114 ms 296168 KB Output is correct
55 Correct 110 ms 296300 KB Output is correct
56 Correct 109 ms 296348 KB Output is correct
57 Correct 108 ms 296272 KB Output is correct
58 Correct 129 ms 296072 KB Output is correct
59 Correct 108 ms 296016 KB Output is correct
60 Correct 106 ms 295996 KB Output is correct
61 Correct 943 ms 419152 KB Output is correct
62 Correct 2003 ms 562964 KB Output is correct
63 Correct 2013 ms 564348 KB Output is correct
64 Correct 1993 ms 564132 KB Output is correct
65 Correct 222 ms 331604 KB Output is correct
66 Correct 371 ms 365876 KB Output is correct
67 Correct 360 ms 368720 KB Output is correct
68 Correct 108 ms 296016 KB Output is correct
69 Correct 136 ms 295868 KB Output is correct
70 Correct 110 ms 295868 KB Output is correct
71 Correct 138 ms 296020 KB Output is correct
72 Correct 110 ms 295816 KB Output is correct
73 Correct 2799 ms 760036 KB Output is correct
74 Correct 2636 ms 693360 KB Output is correct
75 Correct 2090 ms 693448 KB Output is correct
76 Correct 2052 ms 629976 KB Output is correct
77 Runtime error 3956 ms 1048576 KB Execution killed with signal 9
78 Halted 0 ms 0 KB -