oj.uz

Submission #155950

# Submission time Handle Problem Language Result Execution time Memory
155950 2019-10-02T07:15:26 Z Minnakhmetov Orchard (NOI14_orchard) C++14
8 / 25
 1000 ms 4180 KB 
#include <bits/stdc++.h>
   
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()
 
using namespace std;

const int M1 = 1e6 + 5, INF = 1e9;
int a[M1];

int solveForLine(int n, int m) {
    for (int i = 1; i <= m; i++) {
        cin >> a[i];
    }

    for (int i = 1; i <= m; i++) {
        a[i] += a[i - 1];
    }

    int ans = INF;

    for (int i = 0; i < m; i++) {
        for (int j = i; j <= m; j++) {
            ans = min(ans, a[m] + j - i - (a[j] - a[i]) * 2);
        }
    }

    return ans;
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n, m;
    cin >> n >> m;

    if (n == 1) {
        cout << solveForLine(n, m);
    }



    return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 137 ms 448 KB Output is correct
2 Correct 138 ms 476 KB Output is correct
3 Correct 140 ms 376 KB Output is correct

Subtask #3
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1049 ms 4180 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 3.0

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

Subtask #5
0 / 4.0

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

Subtask #6
0 / 5.0

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