oj.uz

Submission #969293

# Submission time Handle Problem Language Result Execution time Memory
969293 2024-04-24T22:16:52 Z NemanjaSo2005 Rectangles (IOI19_rect) C++17
49 / 100
 625 ms 215124 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;
         if(N<=700 and M<=700)
         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 79 ms 147792 KB Output is correct
2 Correct 43 ms 147776 KB Output is correct
3 Correct 45 ms 147868 KB Output is correct
4 Correct 43 ms 147796 KB Output is correct
5 Correct 43 ms 147796 KB Output is correct
6 Correct 43 ms 147804 KB Output is correct
7 Correct 44 ms 147840 KB Output is correct
8 Correct 45 ms 147796 KB Output is correct
9 Correct 47 ms 147804 KB Output is correct
10 Correct 42 ms 147876 KB Output is correct
11 Correct 45 ms 147792 KB Output is correct
12 Correct 49 ms 147796 KB Output is correct
13 Correct 44 ms 147780 KB Output is correct
14 Correct 45 ms 147816 KB Output is correct
15 Correct 45 ms 147796 KB Output is correct
16 Correct 42 ms 147680 KB Output is correct
17 Correct 43 ms 147804 KB Output is correct
18 Correct 43 ms 147792 KB Output is correct
19 Correct 46 ms 147880 KB Output is correct
20 Correct 44 ms 147752 KB Output is correct
21 Correct 43 ms 147800 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 147792 KB Output is correct
2 Correct 43 ms 147776 KB Output is correct
3 Correct 45 ms 147868 KB Output is correct
4 Correct 43 ms 147796 KB Output is correct
5 Correct 43 ms 147796 KB Output is correct
6 Correct 43 ms 147804 KB Output is correct
7 Correct 44 ms 147840 KB Output is correct
8 Correct 45 ms 147796 KB Output is correct
9 Correct 47 ms 147804 KB Output is correct
10 Correct 42 ms 147876 KB Output is correct
11 Correct 45 ms 147792 KB Output is correct
12 Correct 49 ms 147796 KB Output is correct
13 Correct 44 ms 147780 KB Output is correct
14 Correct 45 ms 147816 KB Output is correct
15 Correct 45 ms 147796 KB Output is correct
16 Correct 42 ms 147680 KB Output is correct
17 Correct 43 ms 147804 KB Output is correct
18 Correct 43 ms 147792 KB Output is correct
19 Correct 46 ms 147880 KB Output is correct
20 Correct 44 ms 147752 KB Output is correct
21 Correct 43 ms 147800 KB Output is correct
22 Correct 46 ms 148316 KB Output is correct
23 Correct 46 ms 148308 KB Output is correct
24 Correct 47 ms 148448 KB Output is correct
25 Correct 44 ms 148020 KB Output is correct
26 Correct 53 ms 148284 KB Output is correct
27 Correct 49 ms 148240 KB Output is correct
28 Correct 62 ms 148308 KB Output is correct
29 Correct 44 ms 148132 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 147792 KB Output is correct
2 Correct 43 ms 147776 KB Output is correct
3 Correct 45 ms 147868 KB Output is correct
4 Correct 43 ms 147796 KB Output is correct
5 Correct 43 ms 147796 KB Output is correct
6 Correct 43 ms 147804 KB Output is correct
7 Correct 44 ms 147840 KB Output is correct
8 Correct 45 ms 147796 KB Output is correct
9 Correct 47 ms 147804 KB Output is correct
10 Correct 42 ms 147876 KB Output is correct
11 Correct 45 ms 147792 KB Output is correct
12 Correct 49 ms 147796 KB Output is correct
13 Correct 44 ms 147780 KB Output is correct
14 Correct 45 ms 147816 KB Output is correct
15 Correct 45 ms 147796 KB Output is correct
16 Correct 42 ms 147680 KB Output is correct
17 Correct 46 ms 148316 KB Output is correct
18 Correct 46 ms 148308 KB Output is correct
19 Correct 47 ms 148448 KB Output is correct
20 Correct 44 ms 148020 KB Output is correct
21 Correct 53 ms 148284 KB Output is correct
22 Correct 49 ms 148240 KB Output is correct
23 Correct 62 ms 148308 KB Output is correct
24 Correct 44 ms 148132 KB Output is correct
25 Correct 43 ms 147804 KB Output is correct
26 Correct 43 ms 147792 KB Output is correct
27 Correct 46 ms 147880 KB Output is correct
28 Correct 44 ms 147752 KB Output is correct
29 Correct 43 ms 147800 KB Output is correct
30 Correct 62 ms 151924 KB Output is correct
31 Correct 61 ms 151888 KB Output is correct
32 Correct 64 ms 151892 KB Output is correct
33 Correct 55 ms 149588 KB Output is correct
34 Correct 69 ms 151124 KB Output is correct
35 Correct 67 ms 151304 KB Output is correct
36 Correct 71 ms 151380 KB Output is correct
37 Correct 76 ms 150824 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 147792 KB Output is correct
2 Correct 43 ms 147776 KB Output is correct
3 Correct 45 ms 147868 KB Output is correct
4 Correct 43 ms 147796 KB Output is correct
5 Correct 43 ms 147796 KB Output is correct
6 Correct 43 ms 147804 KB Output is correct
7 Correct 44 ms 147840 KB Output is correct
8 Correct 45 ms 147796 KB Output is correct
9 Correct 47 ms 147804 KB Output is correct
10 Correct 42 ms 147876 KB Output is correct
11 Correct 45 ms 147792 KB Output is correct
12 Correct 49 ms 147796 KB Output is correct
13 Correct 44 ms 147780 KB Output is correct
14 Correct 45 ms 147816 KB Output is correct
15 Correct 45 ms 147796 KB Output is correct
16 Correct 42 ms 147680 KB Output is correct
17 Correct 46 ms 148316 KB Output is correct
18 Correct 46 ms 148308 KB Output is correct
19 Correct 47 ms 148448 KB Output is correct
20 Correct 44 ms 148020 KB Output is correct
21 Correct 53 ms 148284 KB Output is correct
22 Correct 49 ms 148240 KB Output is correct
23 Correct 62 ms 148308 KB Output is correct
24 Correct 44 ms 148132 KB Output is correct
25 Correct 62 ms 151924 KB Output is correct
26 Correct 61 ms 151888 KB Output is correct
27 Correct 64 ms 151892 KB Output is correct
28 Correct 55 ms 149588 KB Output is correct
29 Correct 69 ms 151124 KB Output is correct
30 Correct 67 ms 151304 KB Output is correct
31 Correct 71 ms 151380 KB Output is correct
32 Correct 76 ms 150824 KB Output is correct
33 Correct 43 ms 147804 KB Output is correct
34 Correct 43 ms 147792 KB Output is correct
35 Correct 46 ms 147880 KB Output is correct
36 Correct 44 ms 147752 KB Output is correct
37 Correct 43 ms 147800 KB Output is correct
38 Correct 187 ms 174692 KB Output is correct
39 Correct 170 ms 169816 KB Output is correct
40 Correct 181 ms 174668 KB Output is correct
41 Correct 166 ms 169808 KB Output is correct
42 Correct 394 ms 197460 KB Output is correct
43 Correct 390 ms 197456 KB Output is correct
44 Correct 391 ms 197620 KB Output is correct
45 Correct 363 ms 194352 KB Output is correct
46 Correct 159 ms 163256 KB Output is correct
47 Correct 203 ms 168528 KB Output is correct
48 Correct 441 ms 190288 KB Output is correct
49 Correct 445 ms 191060 KB Output is correct
50 Correct 220 ms 176676 KB Output is correct
51 Correct 230 ms 169112 KB Output is correct
52 Correct 416 ms 187460 KB Output is correct
53 Correct 420 ms 187692 KB Output is correct

Subtask #5
0 / 10.0

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

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 147804 KB Output is correct
2 Correct 43 ms 147792 KB Output is correct
3 Correct 46 ms 147880 KB Output is correct
4 Correct 44 ms 147752 KB Output is correct
5 Correct 43 ms 147800 KB Output is correct
6 Correct 43 ms 147804 KB Output is correct
7 Incorrect 625 ms 215124 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 147792 KB Output is correct
2 Correct 43 ms 147776 KB Output is correct
3 Correct 45 ms 147868 KB Output is correct
4 Correct 43 ms 147796 KB Output is correct
5 Correct 43 ms 147796 KB Output is correct
6 Correct 43 ms 147804 KB Output is correct
7 Correct 44 ms 147840 KB Output is correct
8 Correct 45 ms 147796 KB Output is correct
9 Correct 47 ms 147804 KB Output is correct
10 Correct 42 ms 147876 KB Output is correct
11 Correct 45 ms 147792 KB Output is correct
12 Correct 49 ms 147796 KB Output is correct
13 Correct 44 ms 147780 KB Output is correct
14 Correct 45 ms 147816 KB Output is correct
15 Correct 45 ms 147796 KB Output is correct
16 Correct 42 ms 147680 KB Output is correct
17 Correct 46 ms 148316 KB Output is correct
18 Correct 46 ms 148308 KB Output is correct
19 Correct 47 ms 148448 KB Output is correct
20 Correct 44 ms 148020 KB Output is correct
21 Correct 53 ms 148284 KB Output is correct
22 Correct 49 ms 148240 KB Output is correct
23 Correct 62 ms 148308 KB Output is correct
24 Correct 44 ms 148132 KB Output is correct
25 Correct 62 ms 151924 KB Output is correct
26 Correct 61 ms 151888 KB Output is correct
27 Correct 64 ms 151892 KB Output is correct
28 Correct 55 ms 149588 KB Output is correct
29 Correct 69 ms 151124 KB Output is correct
30 Correct 67 ms 151304 KB Output is correct
31 Correct 71 ms 151380 KB Output is correct
32 Correct 76 ms 150824 KB Output is correct
33 Correct 187 ms 174692 KB Output is correct
34 Correct 170 ms 169816 KB Output is correct
35 Correct 181 ms 174668 KB Output is correct
36 Correct 166 ms 169808 KB Output is correct
37 Correct 394 ms 197460 KB Output is correct
38 Correct 390 ms 197456 KB Output is correct
39 Correct 391 ms 197620 KB Output is correct
40 Correct 363 ms 194352 KB Output is correct
41 Correct 159 ms 163256 KB Output is correct
42 Correct 203 ms 168528 KB Output is correct
43 Correct 441 ms 190288 KB Output is correct
44 Correct 445 ms 191060 KB Output is correct
45 Correct 220 ms 176676 KB Output is correct
46 Correct 230 ms 169112 KB Output is correct
47 Correct 416 ms 187460 KB Output is correct
48 Correct 420 ms 187692 KB Output is correct
49 Incorrect 45 ms 148056 KB Output isn't correct
50 Halted 0 ms 0 KB -