oj.uz

답안 #242742

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
242742 2020-06-29T08:33:47 Z SamAnd 과수원 (NOI14_orchard) C++17
0 / 25
 429 ms 29780 KB 
#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
typedef long long ll;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rnf(2106);
const int N = 1000006;

int n, m;
int** a;

int u[N];

void solv()
{
    scanf("%d%d", &n, &m);
    a = new int*[n + 5];
    for (int i = 0; i < n + 5; ++i)
    {
        a[i] = new int[m + 5];
        for (int j = 0; j < m + 5; ++j)
            a[i][j] = 0;
    }
    int q1 = 0;
    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= m; ++j)
        {
            scanf("%d", &a[i][j]);
            if (a[i][j] == 1)
                ++q1;
        }
    }
    int ans = 0;
    for (int l = 1; l <= n; ++l)
    {
        for (int j = 1; j <= m; ++j)
            u[j] = 0;
        for (int r = l; r <= n; ++r)
        {
            int p = 0;
            int maxu = 0;
            for (int j = 1; j <= m; ++j)
            {
                if (a[r][j] == 0)
                    ++u[j];
                else
                    --u[j];
                p += u[j];
                maxu = max(maxu, u[j]);
                ans = min(ans, p - maxu);
            }
        }
    }
    ans += q1;
    printf("%d\n", ans);
}

int main()
{
    #ifdef SOMETHING
    freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    #endif // SOMETHING
    //ios_base::sync_with_stdio(false), cin.tie(0);
    solv();
    return 0;
}

//while ((double)clock() / CLOCKS_PER_SEC <= 0.9){}

Compilation message

orchard.cpp: In function 'void solv()':
orchard.cpp:20:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~
orchard.cpp:33:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d", &a[i][j]);
             ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Incorrect 4 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 768 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 122 ms 29780 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 27 ms 3960 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 8 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 429 ms 4916 KB Output isn't correct
2 Halted 0 ms 0 KB -