oj.uz

Submission #155949

# Submission time Handle Problem Language Result Execution time Memory
155949 2019-10-02T07:13:02 Z Minnakhmetov Orchard (NOI14_orchard) C++14
4 / 25
 1000 ms 5980 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 = 0; i < m; i++) {
        cin >> a[i];
    }
    for (int i = 0; i < m; i++) {
        a[i + 1] += a[i];
    }

    int ans = INF;

    for (int i = 0; i < m; i++) {
        for (int j = i + 1; 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
0 / 4.0

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

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 137 ms 504 KB Output is correct
2 Correct 137 ms 472 KB Output is correct
3 Correct 137 ms 504 KB Output is correct

Subtask #3
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1051 ms 5980 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 404 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 -