oj.uz

답안 #969256

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
969256 2024-04-24T20:21:23 Z NemanjaSo2005 Rectangles (IOI19_rect) C++17
37 / 100
 5000 ms 119836 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 prav{
   int u,d,l,r;
};
vector<prav> A,B;
bool seseku(prav a,prav b){
   swap(a,b);
   if(a.l>b.l)
      return false;
   if(a.r<b.r)
      return false;
   if(b.u>a.u)
      return false;
   if(b.d<a.d)
      return false;
   return true;
}
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;
            mapa[i+1].erase(x);
         }
         else
            mapa[i][x]=1;
      }
   }

   for(int i=1;i<=N-2;i++)
      for(auto it=mapa[i].begin();it!=mapa[i].end();it++){
         prav pp;
         pp.u=i;
         pp.d=(it->second)+i-1;
         pp.l=(it->first).first;
         pp.r=(it->first).second;
         A.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;
            mapa[i+1].erase(x);
         }
         else
            mapa[i][x]=1;
      }
   }

   for(int i=1;i<=M-2;i++)
      for(auto it=mapa[i].begin();it!=mapa[i].end();it++){
         prav pp;
         pp.l=i;
         pp.r=(it->second)+i-1;
         pp.u=(it->first).first;
         pp.d=(it->first).second;
         B.push_back(pp);
      }
  /* cout<<"VERTIKALNI"<<endl;
   for(prav a:A){
      cout<<a.u<<" "<<a.l<<" "<<a.d<<" "<<a.r<<endl;
   }
   cout<<"HORIZONTALNI"<<endl;
   for(prav a:B){
      cout<<a.u<<" "<<a.l<<" "<<a.d<<" "<<a.r<<endl;
   }*/

   int res=0;
   for(prav a:A)
      for(prav b:B)
         if(seseku(a,b))
            res++;
   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++)
      |                   ~^~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2648 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2568 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2648 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 2 ms 2652 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 2648 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2648 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2568 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2648 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 2 ms 2652 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 2648 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 5 ms 2652 KB Output is correct
23 Correct 2 ms 2652 KB Output is correct
24 Correct 2 ms 2652 KB Output is correct
25 Correct 6 ms 2908 KB Output is correct
26 Correct 25 ms 3164 KB Output is correct
27 Correct 26 ms 3164 KB Output is correct
28 Correct 22 ms 3164 KB Output is correct
29 Correct 4 ms 2908 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2648 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2568 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2648 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 2 ms 2652 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 5 ms 2652 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 2 ms 2652 KB Output is correct
20 Correct 6 ms 2908 KB Output is correct
21 Correct 25 ms 3164 KB Output is correct
22 Correct 26 ms 3164 KB Output is correct
23 Correct 22 ms 3164 KB Output is correct
24 Correct 4 ms 2908 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 2648 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 12 ms 3164 KB Output is correct
31 Correct 11 ms 3200 KB Output is correct
32 Correct 12 ms 3280 KB Output is correct
33 Correct 196 ms 4444 KB Output is correct
34 Correct 1028 ms 6132 KB Output is correct
35 Correct 1054 ms 6476 KB Output is correct
36 Correct 660 ms 5968 KB Output is correct
37 Correct 674 ms 5832 KB Output is correct

Subtask #4
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2648 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2568 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2648 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 2 ms 2652 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 5 ms 2652 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 2 ms 2652 KB Output is correct
20 Correct 6 ms 2908 KB Output is correct
21 Correct 25 ms 3164 KB Output is correct
22 Correct 26 ms 3164 KB Output is correct
23 Correct 22 ms 3164 KB Output is correct
24 Correct 4 ms 2908 KB Output is correct
25 Correct 12 ms 3164 KB Output is correct
26 Correct 11 ms 3200 KB Output is correct
27 Correct 12 ms 3280 KB Output is correct
28 Correct 196 ms 4444 KB Output is correct
29 Correct 1028 ms 6132 KB Output is correct
30 Correct 1054 ms 6476 KB Output is correct
31 Correct 660 ms 5968 KB Output is correct
32 Correct 674 ms 5832 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 2648 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 1 ms 2396 KB Output is correct
38 Execution timed out 5012 ms 41144 KB Time limit exceeded
39 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2904 KB Output is correct
2 Correct 2 ms 2908 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 3 ms 2908 KB Output is correct
6 Correct 3 ms 2904 KB Output is correct
7 Correct 3 ms 2960 KB Output is correct
8 Correct 3 ms 3160 KB Output is correct
9 Correct 3 ms 2904 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 2648 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Execution timed out 5041 ms 119836 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2648 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2568 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2648 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 2 ms 2652 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 5 ms 2652 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 2 ms 2652 KB Output is correct
20 Correct 6 ms 2908 KB Output is correct
21 Correct 25 ms 3164 KB Output is correct
22 Correct 26 ms 3164 KB Output is correct
23 Correct 22 ms 3164 KB Output is correct
24 Correct 4 ms 2908 KB Output is correct
25 Correct 12 ms 3164 KB Output is correct
26 Correct 11 ms 3200 KB Output is correct
27 Correct 12 ms 3280 KB Output is correct
28 Correct 196 ms 4444 KB Output is correct
29 Correct 1028 ms 6132 KB Output is correct
30 Correct 1054 ms 6476 KB Output is correct
31 Correct 660 ms 5968 KB Output is correct
32 Correct 674 ms 5832 KB Output is correct
33 Execution timed out 5012 ms 41144 KB Time limit exceeded
34 Halted 0 ms 0 KB -