oj.uz

Submission #969294

# Submission time Handle Problem Language Result Execution time Memory
969294 2024-04-24T22:17:29 Z NemanjaSo2005 Rectangles (IOI19_rect) C++17
72 / 100
 5000 ms 831972 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;
}
ll resi(vector<slog> &A,vector<slog> &B){
  /* cout<<"RESI"<<endl;
   for(auto x:A)
      cout<<x.kol<<" "<<x.duz<<"    ";
   cout<<endl;
   for(auto x:B)
      cout<<x.kol<<" "<<x.duz<<"    ";
   cout<<endl;
*/
   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;
      
         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 'long long int resi(std::vector<slog>&, std::vector<slog>&)':
rect.cpp:102:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<slog>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  102 |    for(int i=0;i<B.size();i++)
      |                ~^~~~~~~~~
rect.cpp:106:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<slog>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  106 |    for(int i=0;i<A.size();i++){
      |                ~^~~~~~~~~
rect.cpp:107:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<slog>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  107 |       while(pok<B.size()){
      |             ~~~^~~~~~~~~
rect.cpp:116:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<slog>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  116 |    while(pok<B.size()){
      |          ~~~^~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 147804 KB Output is correct
2 Correct 44 ms 147804 KB Output is correct
3 Correct 43 ms 147868 KB Output is correct
4 Correct 44 ms 147804 KB Output is correct
5 Correct 46 ms 147796 KB Output is correct
6 Correct 43 ms 147792 KB Output is correct
7 Correct 43 ms 147824 KB Output is correct
8 Correct 43 ms 147804 KB Output is correct
9 Correct 44 ms 147800 KB Output is correct
10 Correct 44 ms 147800 KB Output is correct
11 Correct 44 ms 147804 KB Output is correct
12 Correct 43 ms 147804 KB Output is correct
13 Correct 43 ms 147996 KB Output is correct
14 Correct 46 ms 147792 KB Output is correct
15 Correct 43 ms 147724 KB Output is correct
16 Correct 44 ms 147800 KB Output is correct
17 Correct 46 ms 147724 KB Output is correct
18 Correct 45 ms 147796 KB Output is correct
19 Correct 44 ms 147804 KB Output is correct
20 Correct 48 ms 148116 KB Output is correct
21 Correct 42 ms 147712 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 147804 KB Output is correct
2 Correct 44 ms 147804 KB Output is correct
3 Correct 43 ms 147868 KB Output is correct
4 Correct 44 ms 147804 KB Output is correct
5 Correct 46 ms 147796 KB Output is correct
6 Correct 43 ms 147792 KB Output is correct
7 Correct 43 ms 147824 KB Output is correct
8 Correct 43 ms 147804 KB Output is correct
9 Correct 44 ms 147800 KB Output is correct
10 Correct 44 ms 147800 KB Output is correct
11 Correct 44 ms 147804 KB Output is correct
12 Correct 43 ms 147804 KB Output is correct
13 Correct 43 ms 147996 KB Output is correct
14 Correct 46 ms 147792 KB Output is correct
15 Correct 43 ms 147724 KB Output is correct
16 Correct 44 ms 147800 KB Output is correct
17 Correct 46 ms 147724 KB Output is correct
18 Correct 45 ms 147796 KB Output is correct
19 Correct 44 ms 147804 KB Output is correct
20 Correct 48 ms 148116 KB Output is correct
21 Correct 42 ms 147712 KB Output is correct
22 Correct 58 ms 148312 KB Output is correct
23 Correct 45 ms 148304 KB Output is correct
24 Correct 45 ms 148304 KB Output is correct
25 Correct 48 ms 148052 KB Output is correct
26 Correct 46 ms 148316 KB Output is correct
27 Correct 47 ms 148332 KB Output is correct
28 Correct 47 ms 148304 KB Output is correct
29 Correct 45 ms 148056 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 147804 KB Output is correct
2 Correct 44 ms 147804 KB Output is correct
3 Correct 43 ms 147868 KB Output is correct
4 Correct 44 ms 147804 KB Output is correct
5 Correct 46 ms 147796 KB Output is correct
6 Correct 43 ms 147792 KB Output is correct
7 Correct 43 ms 147824 KB Output is correct
8 Correct 43 ms 147804 KB Output is correct
9 Correct 44 ms 147800 KB Output is correct
10 Correct 44 ms 147800 KB Output is correct
11 Correct 44 ms 147804 KB Output is correct
12 Correct 43 ms 147804 KB Output is correct
13 Correct 43 ms 147996 KB Output is correct
14 Correct 46 ms 147792 KB Output is correct
15 Correct 43 ms 147724 KB Output is correct
16 Correct 44 ms 147800 KB Output is correct
17 Correct 58 ms 148312 KB Output is correct
18 Correct 45 ms 148304 KB Output is correct
19 Correct 45 ms 148304 KB Output is correct
20 Correct 48 ms 148052 KB Output is correct
21 Correct 46 ms 148316 KB Output is correct
22 Correct 47 ms 148332 KB Output is correct
23 Correct 47 ms 148304 KB Output is correct
24 Correct 45 ms 148056 KB Output is correct
25 Correct 46 ms 147724 KB Output is correct
26 Correct 45 ms 147796 KB Output is correct
27 Correct 44 ms 147804 KB Output is correct
28 Correct 48 ms 148116 KB Output is correct
29 Correct 42 ms 147712 KB Output is correct
30 Correct 60 ms 151708 KB Output is correct
31 Correct 68 ms 151892 KB Output is correct
32 Correct 63 ms 151888 KB Output is correct
33 Correct 55 ms 149596 KB Output is correct
34 Correct 68 ms 151124 KB Output is correct
35 Correct 68 ms 151132 KB Output is correct
36 Correct 67 ms 150864 KB Output is correct
37 Correct 68 ms 150868 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 147804 KB Output is correct
2 Correct 44 ms 147804 KB Output is correct
3 Correct 43 ms 147868 KB Output is correct
4 Correct 44 ms 147804 KB Output is correct
5 Correct 46 ms 147796 KB Output is correct
6 Correct 43 ms 147792 KB Output is correct
7 Correct 43 ms 147824 KB Output is correct
8 Correct 43 ms 147804 KB Output is correct
9 Correct 44 ms 147800 KB Output is correct
10 Correct 44 ms 147800 KB Output is correct
11 Correct 44 ms 147804 KB Output is correct
12 Correct 43 ms 147804 KB Output is correct
13 Correct 43 ms 147996 KB Output is correct
14 Correct 46 ms 147792 KB Output is correct
15 Correct 43 ms 147724 KB Output is correct
16 Correct 44 ms 147800 KB Output is correct
17 Correct 58 ms 148312 KB Output is correct
18 Correct 45 ms 148304 KB Output is correct
19 Correct 45 ms 148304 KB Output is correct
20 Correct 48 ms 148052 KB Output is correct
21 Correct 46 ms 148316 KB Output is correct
22 Correct 47 ms 148332 KB Output is correct
23 Correct 47 ms 148304 KB Output is correct
24 Correct 45 ms 148056 KB Output is correct
25 Correct 60 ms 151708 KB Output is correct
26 Correct 68 ms 151892 KB Output is correct
27 Correct 63 ms 151888 KB Output is correct
28 Correct 55 ms 149596 KB Output is correct
29 Correct 68 ms 151124 KB Output is correct
30 Correct 68 ms 151132 KB Output is correct
31 Correct 67 ms 150864 KB Output is correct
32 Correct 68 ms 150868 KB Output is correct
33 Correct 46 ms 147724 KB Output is correct
34 Correct 45 ms 147796 KB Output is correct
35 Correct 44 ms 147804 KB Output is correct
36 Correct 48 ms 148116 KB Output is correct
37 Correct 42 ms 147712 KB Output is correct
38 Correct 177 ms 174668 KB Output is correct
39 Correct 171 ms 169984 KB Output is correct
40 Correct 177 ms 174676 KB Output is correct
41 Correct 181 ms 169932 KB Output is correct
42 Correct 383 ms 197620 KB Output is correct
43 Correct 391 ms 197460 KB Output is correct
44 Correct 388 ms 198224 KB Output is correct
45 Correct 371 ms 194352 KB Output is correct
46 Correct 159 ms 163628 KB Output is correct
47 Correct 203 ms 168528 KB Output is correct
48 Correct 429 ms 190288 KB Output is correct
49 Correct 435 ms 190800 KB Output is correct
50 Correct 220 ms 176468 KB Output is correct
51 Correct 227 ms 169300 KB Output is correct
52 Correct 414 ms 187472 KB Output is correct
53 Correct 421 ms 187728 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 148056 KB Output is correct
2 Correct 45 ms 148116 KB Output is correct
3 Correct 45 ms 147856 KB Output is correct
4 Correct 44 ms 147796 KB Output is correct
5 Correct 45 ms 148056 KB Output is correct
6 Correct 46 ms 148052 KB Output is correct
7 Correct 46 ms 148060 KB Output is correct
8 Correct 45 ms 148052 KB Output is correct
9 Correct 47 ms 148348 KB Output is correct
10 Correct 43 ms 147792 KB Output is correct
11 Correct 45 ms 147804 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 147724 KB Output is correct
2 Correct 45 ms 147796 KB Output is correct
3 Correct 44 ms 147804 KB Output is correct
4 Correct 48 ms 148116 KB Output is correct
5 Correct 42 ms 147712 KB Output is correct
6 Correct 44 ms 147796 KB Output is correct
7 Correct 745 ms 237528 KB Output is correct
8 Correct 1599 ms 342560 KB Output is correct
9 Correct 1593 ms 343728 KB Output is correct
10 Correct 1598 ms 343584 KB Output is correct
11 Correct 143 ms 172112 KB Output is correct
12 Correct 264 ms 193752 KB Output is correct
13 Correct 274 ms 196948 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 147804 KB Output is correct
2 Correct 44 ms 147804 KB Output is correct
3 Correct 43 ms 147868 KB Output is correct
4 Correct 44 ms 147804 KB Output is correct
5 Correct 46 ms 147796 KB Output is correct
6 Correct 43 ms 147792 KB Output is correct
7 Correct 43 ms 147824 KB Output is correct
8 Correct 43 ms 147804 KB Output is correct
9 Correct 44 ms 147800 KB Output is correct
10 Correct 44 ms 147800 KB Output is correct
11 Correct 44 ms 147804 KB Output is correct
12 Correct 43 ms 147804 KB Output is correct
13 Correct 43 ms 147996 KB Output is correct
14 Correct 46 ms 147792 KB Output is correct
15 Correct 43 ms 147724 KB Output is correct
16 Correct 44 ms 147800 KB Output is correct
17 Correct 58 ms 148312 KB Output is correct
18 Correct 45 ms 148304 KB Output is correct
19 Correct 45 ms 148304 KB Output is correct
20 Correct 48 ms 148052 KB Output is correct
21 Correct 46 ms 148316 KB Output is correct
22 Correct 47 ms 148332 KB Output is correct
23 Correct 47 ms 148304 KB Output is correct
24 Correct 45 ms 148056 KB Output is correct
25 Correct 60 ms 151708 KB Output is correct
26 Correct 68 ms 151892 KB Output is correct
27 Correct 63 ms 151888 KB Output is correct
28 Correct 55 ms 149596 KB Output is correct
29 Correct 68 ms 151124 KB Output is correct
30 Correct 68 ms 151132 KB Output is correct
31 Correct 67 ms 150864 KB Output is correct
32 Correct 68 ms 150868 KB Output is correct
33 Correct 177 ms 174668 KB Output is correct
34 Correct 171 ms 169984 KB Output is correct
35 Correct 177 ms 174676 KB Output is correct
36 Correct 181 ms 169932 KB Output is correct
37 Correct 383 ms 197620 KB Output is correct
38 Correct 391 ms 197460 KB Output is correct
39 Correct 388 ms 198224 KB Output is correct
40 Correct 371 ms 194352 KB Output is correct
41 Correct 159 ms 163628 KB Output is correct
42 Correct 203 ms 168528 KB Output is correct
43 Correct 429 ms 190288 KB Output is correct
44 Correct 435 ms 190800 KB Output is correct
45 Correct 220 ms 176468 KB Output is correct
46 Correct 227 ms 169300 KB Output is correct
47 Correct 414 ms 187472 KB Output is correct
48 Correct 421 ms 187728 KB Output is correct
49 Correct 45 ms 148056 KB Output is correct
50 Correct 45 ms 148116 KB Output is correct
51 Correct 45 ms 147856 KB Output is correct
52 Correct 44 ms 147796 KB Output is correct
53 Correct 45 ms 148056 KB Output is correct
54 Correct 46 ms 148052 KB Output is correct
55 Correct 46 ms 148060 KB Output is correct
56 Correct 45 ms 148052 KB Output is correct
57 Correct 47 ms 148348 KB Output is correct
58 Correct 43 ms 147792 KB Output is correct
59 Correct 45 ms 147804 KB Output is correct
60 Correct 44 ms 147796 KB Output is correct
61 Correct 745 ms 237528 KB Output is correct
62 Correct 1599 ms 342560 KB Output is correct
63 Correct 1593 ms 343728 KB Output is correct
64 Correct 1598 ms 343584 KB Output is correct
65 Correct 143 ms 172112 KB Output is correct
66 Correct 264 ms 193752 KB Output is correct
67 Correct 274 ms 196948 KB Output is correct
68 Correct 46 ms 147724 KB Output is correct
69 Correct 45 ms 147796 KB Output is correct
70 Correct 44 ms 147804 KB Output is correct
71 Correct 48 ms 148116 KB Output is correct
72 Correct 42 ms 147712 KB Output is correct
73 Correct 2029 ms 490676 KB Output is correct
74 Correct 1856 ms 423508 KB Output is correct
75 Correct 1860 ms 490736 KB Output is correct
76 Correct 1729 ms 423764 KB Output is correct
77 Execution timed out 5102 ms 831972 KB Time limit exceeded
78 Halted 0 ms 0 KB -