oj.uz

답안 #303052

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
303052 2020-09-19T19:43:27 Z iliccmarko 삶의 질 (IOI10_quality) C++14
80 / 100
 5000 ms 145068 KB 
#include <bits/stdc++.h>
#include<quality.h>
using namespace std;
#define ll long long
#define endl "\n"

using namespace std;

int rectangle(int r, int c, int h, int w, int q[3001][3001])
{
    int l = 1;
    int R = r*c;
    int ans;
    while(l<=R)
    {
        int mid = (l+R)/2;
        int mat[r][c];
        for(int i = 0;i<r;i++)
        {
            for(int j = 0;j<c;j++)
            {
                if(q[i][j]<mid)
                    mat[i][j] = -1;
                else if(q[i][j]==mid)
                    mat[i][j] = 0;
                else
                    mat[i][j] = 1;
            }
        }
        int prefix[r][c];
        for(int i = 0;i<r;i++)
        {
            for(int j = 0;j<c;j++)
            {
                if(j==0)
                {
                    prefix[i][j] = mat[i][j];
                }
                else
                {
                    prefix[i][j] = prefix[i][j-1] + mat[i][j];
                }
            }
        }
        int s, e;
        s = e = 0;
        int sum = 0;
        for(int i = w-1;i<c;i++)
        {
            sum = 0;
            for(int j = 0;j<h;j++)
            {
                if(i==w-1)
                {
                    sum+=prefix[j][w-1];
                }
                else
                {
                    sum+=prefix[j][i] - prefix[j][i-w];
                }
            }
            if(sum<0)
            {
                s++;
                break;
            }
            else if(sum==0)
            {
                e++;
            }
            for(int j = h;j<r;j++)
            {
                if(i==w-1)
                {
                    sum-=prefix[j-h][w-1];
                    sum+=prefix[j][w-1];
                }
                else
                {
                    sum-=prefix[j-h][i] - prefix[j-h][i-w];
                    sum+=prefix[j][i] - prefix[j][i-w];
                }
                if(sum<0)
                {
                    s++;
                    break;
                }
                else if(sum==0)
                {
                    e++;
                }
            }
            if(s!=0) break;
        }
        if(s)
        {
            R = mid - 1;
        }
        else if(e)
        {
            ans = mid;
            break;
        }
        else
        {
            l = mid + 1;
        }
    }
    return ans;
}

Compilation message

quality.cpp: In function 'int rectangle(int, int, int, int, int (*)[3001])':
quality.cpp:109:12: warning: 'ans' may be used uninitialized in this function [-Wmaybe-uninitialized]
  109 |     return ans;
      |            ^~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 384 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 3 ms 896 KB Output is correct
5 Correct 3 ms 896 KB Output is correct
6 Correct 3 ms 896 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 3 ms 896 KB Output is correct
5 Correct 3 ms 896 KB Output is correct
6 Correct 3 ms 896 KB Output is correct
7 Correct 29 ms 3144 KB Output is correct
8 Correct 25 ms 3064 KB Output is correct
9 Correct 26 ms 2944 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 3 ms 896 KB Output is correct
5 Correct 3 ms 896 KB Output is correct
6 Correct 3 ms 896 KB Output is correct
7 Correct 29 ms 3144 KB Output is correct
8 Correct 25 ms 3064 KB Output is correct
9 Correct 26 ms 2944 KB Output is correct
10 Correct 342 ms 22904 KB Output is correct
11 Correct 337 ms 22904 KB Output is correct
12 Correct 177 ms 13560 KB Output is correct

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 3 ms 896 KB Output is correct
5 Correct 3 ms 896 KB Output is correct
6 Correct 3 ms 896 KB Output is correct
7 Correct 29 ms 3144 KB Output is correct
8 Correct 25 ms 3064 KB Output is correct
9 Correct 26 ms 2944 KB Output is correct
10 Correct 342 ms 22904 KB Output is correct
11 Correct 337 ms 22904 KB Output is correct
12 Correct 177 ms 13560 KB Output is correct
13 Execution timed out 5061 ms 145068 KB Time limit exceeded
14 Halted 0 ms 0 KB -