Submission #106416

# Submission time Handle Problem Language Result Execution time Memory
106416 2019-04-18T11:12:53 Z BigChungus Hacker (BOI15_hac) C++14
100 / 100
236 ms 12904 KB
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

const int N = 5e5 + 7;

vector < pair < int, pair < int, int > > > sumemici;
int v[N], s[N];


int main()
{
    int n;
    cin >> n;
    for (int i = 1; i <= n; ++i)
        cin >> v[i];
    for (int i = 1; i <= n; ++i)
        s[i] = s[i - 1] + v[i];
    for (int i = 1; i < (n + 1) / 2; ++i)
        sumemici.push_back({s[n] - s[n / 2 + i] + s[i],{i + 1, n / 2 + i}});
    sumemici.push_back({s[(n + 1) / 2], {(n + 1) / 2 + 1, n}});
    sumemici.push_back({s[n] - s[n - (n + 1) / 2], {1, n - (n + 1) / 2}});
    for (int i = (n + 1) / 2 + 1; i < n; ++i)
        sumemici.push_back({s[i] - s[i - (n + 1) / 2], {i + 1, i - (n + 1) / 2}});
    sort(sumemici.begin(), sumemici.end());
    int st(1), dr(n);
    for (auto i : sumemici) {
//        cout << st << ' ' << dr << ' ' << i.first << ' ' << i.second.first << ' ' << i.second.second << '\n';
        auto x = i.second;
        if (x.second < x.first)  {
            if (st <= dr) {
                if (st > x.second && dr < x.first)
                    return cout << i.first, 0;
                if (st <= x.second && dr >= x.first) {
                    st = x.first;
                    dr = x.second;
                    ///asta se poate intampla doar la inceput
                }
                else {
                    if (x.second < st && (!(x.first <= st)))
                        st = x.first;
                    else if (x.first > dr && (!(x.second >= dr)))
                        dr = x.second;
                }
            }
            else {///ambele au pe 1 si n deci nu se poate ca sa nu aiba intersectie(sa aiba int. vida)
                st = max(st, x.first);
                dr = min(dr, x.second);
            }
        }
        else {
            if (st <= dr) {
                if (st > x.second || dr < x.first)
                    return cout << i.first, 0;
                st = max(st, x.first);
                dr = min(dr, x.second);
            }
            else {
                if (x.first > dr && x.second < st)
                    return cout << i.first, 0;
                if (dr < x.first)
                    dr = x.second;
                else
                    st = x.first;
            }
        }
    }
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 3 ms 256 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 3 ms 256 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 3 ms 512 KB Output is correct
20 Correct 3 ms 384 KB Output is correct
21 Correct 3 ms 384 KB Output is correct
22 Correct 3 ms 512 KB Output is correct
23 Correct 4 ms 512 KB Output is correct
24 Correct 3 ms 512 KB Output is correct
25 Correct 4 ms 512 KB Output is correct
26 Correct 5 ms 512 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 2 ms 256 KB Output is correct
30 Correct 4 ms 512 KB Output is correct
31 Correct 4 ms 512 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 43 ms 2672 KB Output is correct
5 Correct 93 ms 5168 KB Output is correct
6 Correct 102 ms 5532 KB Output is correct
7 Correct 166 ms 8908 KB Output is correct
8 Correct 236 ms 10584 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 3 ms 256 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 3 ms 512 KB Output is correct
20 Correct 3 ms 384 KB Output is correct
21 Correct 3 ms 384 KB Output is correct
22 Correct 3 ms 512 KB Output is correct
23 Correct 4 ms 512 KB Output is correct
24 Correct 3 ms 512 KB Output is correct
25 Correct 4 ms 512 KB Output is correct
26 Correct 5 ms 512 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 2 ms 256 KB Output is correct
30 Correct 4 ms 512 KB Output is correct
31 Correct 4 ms 512 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 5 ms 512 KB Output is correct
35 Correct 43 ms 2672 KB Output is correct
36 Correct 93 ms 5168 KB Output is correct
37 Correct 102 ms 5532 KB Output is correct
38 Correct 166 ms 8908 KB Output is correct
39 Correct 236 ms 10584 KB Output is correct
40 Correct 6 ms 768 KB Output is correct
41 Correct 10 ms 1088 KB Output is correct
42 Correct 12 ms 1276 KB Output is correct
43 Correct 77 ms 5996 KB Output is correct
44 Correct 197 ms 12648 KB Output is correct
45 Correct 40 ms 3168 KB Output is correct
46 Correct 120 ms 10400 KB Output is correct
47 Correct 236 ms 12776 KB Output is correct
48 Correct 189 ms 12904 KB Output is correct
49 Correct 212 ms 12108 KB Output is correct
50 Correct 189 ms 12148 KB Output is correct