oj.uz

Submission #867597

# Submission time Handle Problem Language Result Execution time Memory
867597 2023-10-28T20:52:57 Z JakobZorz Rectangles (IOI19_rect) C++17
72 / 100
 5000 ms 218508 KB 
#include"rect.h"
#include<algorithm>
#include<unordered_set>
#include<set>
#include<iostream>
using namespace std;
typedef long long ll;

int gap_right[2500][2500];
int gap_down[2500][2500];
int gap_left[2500][2500];
int gap_up[2500][2500];
int arr[2500][2500];
int w,h;

void process_column(int x){
    vector<pair<int,int>>vals;
    for(int y=0;y<h;y++){
        while(!vals.empty()&&vals.back().first<arr[x][y])
            vals.pop_back();
        gap_up[x][y]=-1;
        if(!vals.empty())
            gap_up[x][y]=vals.back().second;
        vals.emplace_back(arr[x][y],y);
    }
    
    vals.clear();
    for(int y=h-1;y>=0;y--){
        while(!vals.empty()&&vals.back().first<arr[x][y])
            vals.pop_back();
        gap_down[x][y]=2500;
        if(!vals.empty())
            gap_down[x][y]=vals.back().second;
        vals.emplace_back(arr[x][y],y);
    }
}

void process_row(int y){
    vector<pair<int,int>>vals;
    for(int x=0;x<w;x++){
        while(!vals.empty()&&vals.back().first<arr[x][y])
            vals.pop_back();
        gap_left[x][y]=-1;
        if(!vals.empty())
            gap_left[x][y]=vals.back().second;
        vals.emplace_back(arr[x][y],x);
    }
    
    vals.clear();
    for(int x=w;x>=0;x--){
        while(!vals.empty()&&vals.back().first<arr[x][y])
            vals.pop_back();
        gap_right[x][y]=2500;
        if(!vals.empty())
            gap_right[x][y]=vals.back().second;
        vals.emplace_back(arr[x][y],x);
    }
}

int check1(int x1,int x2,int y){
    if(x1==-1||x2==2500||x1==x2-1)
        return 0;
    
    int y1=y-1;
    
    int y2=2500;
    for(int x=x1+1;x<x2;x++){
        y2=min(y2,gap_down[x][y1]);
    }
    
    if(y2>=h)
        return 0;
    
    if(y1==y2-1)
        return 0;
    
    for(int x=x1+1;x<x2;x++)
        if((gap_down[x][y1]!=y2&&gap_up[x][y2]!=y1)||gap_down[x][y1]<y2||gap_up[x][y2]>y1)
            return 0;
    
    for(int y=y1+1;y<y2;y++)
        if((gap_right[x1][y]!=x2&&gap_left[x2][y]!=x1)||gap_right[x1][y]<x2||gap_left[x2][y]>x1)
            return 0;
    
    //cout<<"("<<x1<<" "<<y1<<") ("<<x2<<" "<<y2<<")\n";
    
    return 1;
}

int check2(int x1,int x2,int y){
    if(x1==-1||x2==2500||x1==x2-1)
        return 0;
    
    int y2=y+1;
    
    int y1=-1;
    for(int x=x1+1;x<x2;x++){
        y1=max(y1,gap_up[x][y2]);
    }
    
    if(y1==-1)
        return 0;
    
    if(y1==y2-1)
        return 0;
    
    for(int x=x1+1;x<x2;x++)
        if((gap_down[x][y1]!=y2&&gap_up[x][y2]!=y1)||gap_down[x][y1]<y2||gap_up[x][y2]>y1||gap_down[x][y1]==y2)
            return 0;
    
    for(int y=y1+1;y<y2;y++)
        if((gap_right[x1][y]!=x2&&gap_left[x2][y]!=x1)||gap_right[x1][y]<x2||gap_left[x2][y]>x1)
            return 0;
    
    //cout<<"("<<x1<<" "<<y1<<") ("<<x2<<" "<<y2<<")\n";
    
    return 1;
}

int check(int x1,int x2,int y){
    return check1(x1,x2,y)+check2(x1,x2,y);
}

ll count_rectangles(vector<vector<int>>a_){
    h=(int)a_.size();
    w=(int)a_[0].size();
    for(int x=0;x<w;x++){
        for(int y=0;y<h;y++){
            arr[x][y]=a_[y][x];
        }
    }
    
    for(int x=0;x<w;x++)
        process_column(x);
    
    for(int y=0;y<h;y++)
        process_row(y);
    
    /*for(int y=0;y<h;y++){
        for(int x=0;x<w;x++)
            cout<<gap_left[x][y]<<" ";
        cout<<"\n";
    }*/
    
    ll res=0;
    for(int x=0;x<w;x++)
        for(int y=1;y<h-1;y++){
            res+=check(x,gap_right[x][y],y);
            //cout<<gap_left[x][y+1]<<" "<<x<<" "<<y<<"\n";
            if(arr[gap_left[x][y]][y]!=arr[x][y])
                res+=check(gap_left[x][y],x,y);
        }
    
	return res;
}

Compilation message

rect.cpp: In function 'll count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:146:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  146 |     for(int x=0;x<w;x++)
      |     ^~~
rect.cpp:154:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  154 |  return res;
      |  ^~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8536 KB Output is correct
2 Correct 2 ms 10584 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 1 ms 10588 KB Output is correct
6 Correct 1 ms 10588 KB Output is correct
7 Correct 1 ms 8552 KB Output is correct
8 Correct 1 ms 10588 KB Output is correct
9 Correct 2 ms 10588 KB Output is correct
10 Correct 1 ms 10588 KB Output is correct
11 Correct 2 ms 10588 KB Output is correct
12 Correct 1 ms 10588 KB Output is correct
13 Correct 1 ms 8540 KB Output is correct
14 Correct 1 ms 8540 KB Output is correct
15 Correct 1 ms 8540 KB Output is correct
16 Correct 1 ms 8540 KB Output is correct
17 Correct 1 ms 8540 KB Output is correct
18 Correct 1 ms 8540 KB Output is correct
19 Correct 1 ms 10588 KB Output is correct
20 Correct 1 ms 8540 KB Output is correct
21 Correct 1 ms 8540 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8536 KB Output is correct
2 Correct 2 ms 10584 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 1 ms 10588 KB Output is correct
6 Correct 1 ms 10588 KB Output is correct
7 Correct 1 ms 8552 KB Output is correct
8 Correct 1 ms 10588 KB Output is correct
9 Correct 2 ms 10588 KB Output is correct
10 Correct 1 ms 10588 KB Output is correct
11 Correct 2 ms 10588 KB Output is correct
12 Correct 1 ms 10588 KB Output is correct
13 Correct 1 ms 8540 KB Output is correct
14 Correct 1 ms 8540 KB Output is correct
15 Correct 1 ms 8540 KB Output is correct
16 Correct 1 ms 8540 KB Output is correct
17 Correct 1 ms 8540 KB Output is correct
18 Correct 1 ms 8540 KB Output is correct
19 Correct 1 ms 10588 KB Output is correct
20 Correct 1 ms 8540 KB Output is correct
21 Correct 1 ms 8540 KB Output is correct
22 Correct 3 ms 16988 KB Output is correct
23 Correct 3 ms 16988 KB Output is correct
24 Correct 3 ms 16988 KB Output is correct
25 Correct 2 ms 16988 KB Output is correct
26 Correct 3 ms 16732 KB Output is correct
27 Correct 3 ms 16988 KB Output is correct
28 Correct 3 ms 16988 KB Output is correct
29 Correct 2 ms 12636 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8536 KB Output is correct
2 Correct 2 ms 10584 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 1 ms 10588 KB Output is correct
6 Correct 1 ms 10588 KB Output is correct
7 Correct 1 ms 8552 KB Output is correct
8 Correct 1 ms 10588 KB Output is correct
9 Correct 2 ms 10588 KB Output is correct
10 Correct 1 ms 10588 KB Output is correct
11 Correct 2 ms 10588 KB Output is correct
12 Correct 1 ms 10588 KB Output is correct
13 Correct 1 ms 8540 KB Output is correct
14 Correct 1 ms 8540 KB Output is correct
15 Correct 1 ms 8540 KB Output is correct
16 Correct 1 ms 8540 KB Output is correct
17 Correct 3 ms 16988 KB Output is correct
18 Correct 3 ms 16988 KB Output is correct
19 Correct 3 ms 16988 KB Output is correct
20 Correct 2 ms 16988 KB Output is correct
21 Correct 3 ms 16732 KB Output is correct
22 Correct 3 ms 16988 KB Output is correct
23 Correct 3 ms 16988 KB Output is correct
24 Correct 2 ms 12636 KB Output is correct
25 Correct 1 ms 8540 KB Output is correct
26 Correct 1 ms 8540 KB Output is correct
27 Correct 1 ms 10588 KB Output is correct
28 Correct 1 ms 8540 KB Output is correct
29 Correct 1 ms 8540 KB Output is correct
30 Correct 17 ms 19292 KB Output is correct
31 Correct 16 ms 19288 KB Output is correct
32 Correct 17 ms 19292 KB Output is correct
33 Correct 5 ms 19292 KB Output is correct
34 Correct 6 ms 19288 KB Output is correct
35 Correct 7 ms 19292 KB Output is correct
36 Correct 8 ms 19292 KB Output is correct
37 Correct 7 ms 19292 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8536 KB Output is correct
2 Correct 2 ms 10584 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 1 ms 10588 KB Output is correct
6 Correct 1 ms 10588 KB Output is correct
7 Correct 1 ms 8552 KB Output is correct
8 Correct 1 ms 10588 KB Output is correct
9 Correct 2 ms 10588 KB Output is correct
10 Correct 1 ms 10588 KB Output is correct
11 Correct 2 ms 10588 KB Output is correct
12 Correct 1 ms 10588 KB Output is correct
13 Correct 1 ms 8540 KB Output is correct
14 Correct 1 ms 8540 KB Output is correct
15 Correct 1 ms 8540 KB Output is correct
16 Correct 1 ms 8540 KB Output is correct
17 Correct 3 ms 16988 KB Output is correct
18 Correct 3 ms 16988 KB Output is correct
19 Correct 3 ms 16988 KB Output is correct
20 Correct 2 ms 16988 KB Output is correct
21 Correct 3 ms 16732 KB Output is correct
22 Correct 3 ms 16988 KB Output is correct
23 Correct 3 ms 16988 KB Output is correct
24 Correct 2 ms 12636 KB Output is correct
25 Correct 17 ms 19292 KB Output is correct
26 Correct 16 ms 19288 KB Output is correct
27 Correct 17 ms 19292 KB Output is correct
28 Correct 5 ms 19292 KB Output is correct
29 Correct 6 ms 19288 KB Output is correct
30 Correct 7 ms 19292 KB Output is correct
31 Correct 8 ms 19292 KB Output is correct
32 Correct 7 ms 19292 KB Output is correct
33 Correct 1 ms 8540 KB Output is correct
34 Correct 1 ms 8540 KB Output is correct
35 Correct 1 ms 10588 KB Output is correct
36 Correct 1 ms 8540 KB Output is correct
37 Correct 1 ms 8540 KB Output is correct
38 Correct 133 ms 51648 KB Output is correct
39 Correct 144 ms 51636 KB Output is correct
40 Correct 135 ms 51392 KB Output is correct
41 Correct 133 ms 51796 KB Output is correct
42 Correct 629 ms 55064 KB Output is correct
43 Correct 617 ms 55064 KB Output is correct
44 Correct 663 ms 55184 KB Output is correct
45 Correct 570 ms 54872 KB Output is correct
46 Correct 33 ms 52560 KB Output is correct
47 Correct 41 ms 52572 KB Output is correct
48 Correct 63 ms 53400 KB Output is correct
49 Correct 73 ms 55320 KB Output is correct
50 Correct 36 ms 33000 KB Output is correct
51 Correct 36 ms 51280 KB Output is correct
52 Correct 63 ms 54360 KB Output is correct
53 Correct 67 ms 55356 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 121944 KB Output is correct
2 Correct 19 ms 113244 KB Output is correct
3 Correct 12 ms 121948 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 14 ms 122052 KB Output is correct
6 Correct 13 ms 121948 KB Output is correct
7 Correct 13 ms 122076 KB Output is correct
8 Correct 13 ms 121948 KB Output is correct
9 Correct 15 ms 122064 KB Output is correct
10 Correct 13 ms 121948 KB Output is correct
11 Correct 13 ms 121960 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 1 ms 8536 KB Output is correct
7 Correct 171 ms 144176 KB Output is correct
8 Correct 375 ms 171624 KB Output is correct
9 Correct 366 ms 183948 KB Output is correct
10 Correct 371 ms 184148 KB Output is correct
11 Correct 109 ms 152688 KB Output is correct
12 Correct 197 ms 179360 KB Output is correct
13 Correct 233 ms 183888 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8536 KB Output is correct
2 Correct 2 ms 10584 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 1 ms 10588 KB Output is correct
6 Correct 1 ms 10588 KB Output is correct
7 Correct 1 ms 8552 KB Output is correct
8 Correct 1 ms 10588 KB Output is correct
9 Correct 2 ms 10588 KB Output is correct
10 Correct 1 ms 10588 KB Output is correct
11 Correct 2 ms 10588 KB Output is correct
12 Correct 1 ms 10588 KB Output is correct
13 Correct 1 ms 8540 KB Output is correct
14 Correct 1 ms 8540 KB Output is correct
15 Correct 1 ms 8540 KB Output is correct
16 Correct 1 ms 8540 KB Output is correct
17 Correct 3 ms 16988 KB Output is correct
18 Correct 3 ms 16988 KB Output is correct
19 Correct 3 ms 16988 KB Output is correct
20 Correct 2 ms 16988 KB Output is correct
21 Correct 3 ms 16732 KB Output is correct
22 Correct 3 ms 16988 KB Output is correct
23 Correct 3 ms 16988 KB Output is correct
24 Correct 2 ms 12636 KB Output is correct
25 Correct 17 ms 19292 KB Output is correct
26 Correct 16 ms 19288 KB Output is correct
27 Correct 17 ms 19292 KB Output is correct
28 Correct 5 ms 19292 KB Output is correct
29 Correct 6 ms 19288 KB Output is correct
30 Correct 7 ms 19292 KB Output is correct
31 Correct 8 ms 19292 KB Output is correct
32 Correct 7 ms 19292 KB Output is correct
33 Correct 133 ms 51648 KB Output is correct
34 Correct 144 ms 51636 KB Output is correct
35 Correct 135 ms 51392 KB Output is correct
36 Correct 133 ms 51796 KB Output is correct
37 Correct 629 ms 55064 KB Output is correct
38 Correct 617 ms 55064 KB Output is correct
39 Correct 663 ms 55184 KB Output is correct
40 Correct 570 ms 54872 KB Output is correct
41 Correct 33 ms 52560 KB Output is correct
42 Correct 41 ms 52572 KB Output is correct
43 Correct 63 ms 53400 KB Output is correct
44 Correct 73 ms 55320 KB Output is correct
45 Correct 36 ms 33000 KB Output is correct
46 Correct 36 ms 51280 KB Output is correct
47 Correct 63 ms 54360 KB Output is correct
48 Correct 67 ms 55356 KB Output is correct
49 Correct 22 ms 121944 KB Output is correct
50 Correct 19 ms 113244 KB Output is correct
51 Correct 12 ms 121948 KB Output is correct
52 Correct 1 ms 8540 KB Output is correct
53 Correct 14 ms 122052 KB Output is correct
54 Correct 13 ms 121948 KB Output is correct
55 Correct 13 ms 122076 KB Output is correct
56 Correct 13 ms 121948 KB Output is correct
57 Correct 15 ms 122064 KB Output is correct
58 Correct 13 ms 121948 KB Output is correct
59 Correct 13 ms 121960 KB Output is correct
60 Correct 1 ms 8536 KB Output is correct
61 Correct 171 ms 144176 KB Output is correct
62 Correct 375 ms 171624 KB Output is correct
63 Correct 366 ms 183948 KB Output is correct
64 Correct 371 ms 184148 KB Output is correct
65 Correct 109 ms 152688 KB Output is correct
66 Correct 197 ms 179360 KB Output is correct
67 Correct 233 ms 183888 KB Output is correct
68 Correct 1 ms 8540 KB Output is correct
69 Correct 1 ms 8540 KB Output is correct
70 Correct 1 ms 10588 KB Output is correct
71 Correct 1 ms 8540 KB Output is correct
72 Correct 1 ms 8540 KB Output is correct
73 Execution timed out 5070 ms 218508 KB Time limit exceeded
74 Halted 0 ms 0 KB -