Submission #64427

# Submission time Handle Problem Language Result Execution time Memory
64427 2018-08-04T12:37:34 Z SpeedOfMagic Hacker (BOI15_hac) C++17
40 / 100
1000 ms 187696 KB
/** MIT License Copyright (c) 2018 Vasilyev Daniil **/
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
template<typename T> using v = vector<T>;
#define int long long
typedef long long ll;
typedef long double ld;
typedef string str;
typedef vector<int> vint;
#define rep(a, l, r) for(int a = (l); a < (r); a++)
#define pb push_back
#define sz(a) ((int) a.size())
const long long inf = 4611686018427387903; //2^62 - 1
#if 0  //FileIO
const string fileName = "";
ifstream fin ((fileName == "" ? "input.txt"  : fileName + ".in" ));
ofstream fout((fileName == "" ? "output.txt" : fileName + ".out"));
#define get fin>>
#define put fout<<
#else
#define get cin>>
#define put cout<<
#endif
#define eol put endl
void read() {}     template<typename Arg,typename... Args> void read (Arg& arg,Args&... args){get (arg)     ;read(args...) ;}
void print(){}     template<typename Arg,typename... Args> void print(Arg  arg,Args...  args){put (arg)<<" ";print(args...);}
void debug(){eol;} template<typename Arg,typename... Args> void debug(Arg  arg,Args...  args){put (arg)<<" ";debug(args...);}
char curFlag = 'A'; void flag() {put curFlag++ << endl;}
int getInt(){int a; get a; return a;}
//code goes here

void run() {
    int n;
    get n;
    int v[n];
    rep(i, 0, n)
        get v[i];
    vint d[n];
    rep(i, 0, n) {
        d[i].pb(0);
        rep(j, 0, n / 2 + n % 2) {
            d[i][0] += v[(i + j) % n];
            d[i].pb((i + j) % n);
        }
        //for (int j : d[i])print(j);eol;
    }


    sort(d, d + n);
    int z[n];
    rep(i, 0, n)
        z[i] = 0;
    for (int i = n - 1; i >= 0; i--) {
        rep(j, 1, sz(d[i])) {
            z[d[i][j]]++;
            if (z[d[i][j]] == n / 2 + n % 2) {
                put d[i][0];
                return;
            }
        }
    }
}

int32_t main() {srand(time(0)); ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); put fixed; put setprecision(15); run(); return 0;}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 4 ms 452 KB Output is correct
3 Correct 3 ms 452 KB Output is correct
4 Correct 3 ms 532 KB Output is correct
5 Correct 3 ms 532 KB Output is correct
6 Correct 3 ms 592 KB Output is correct
7 Correct 6 ms 1232 KB Output is correct
8 Correct 5 ms 1232 KB Output is correct
9 Correct 6 ms 1288 KB Output is correct
10 Correct 6 ms 1288 KB Output is correct
11 Correct 6 ms 1352 KB Output is correct
12 Correct 6 ms 1352 KB Output is correct
13 Correct 4 ms 1352 KB Output is correct
14 Correct 4 ms 1352 KB Output is correct
15 Correct 2 ms 1352 KB Output is correct
16 Correct 6 ms 1352 KB Output is correct
17 Correct 5 ms 1392 KB Output is correct
18 Correct 7 ms 1428 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 4 ms 452 KB Output is correct
3 Correct 3 ms 452 KB Output is correct
4 Correct 3 ms 532 KB Output is correct
5 Correct 3 ms 532 KB Output is correct
6 Correct 3 ms 592 KB Output is correct
7 Correct 6 ms 1232 KB Output is correct
8 Correct 5 ms 1232 KB Output is correct
9 Correct 6 ms 1288 KB Output is correct
10 Correct 6 ms 1288 KB Output is correct
11 Correct 6 ms 1352 KB Output is correct
12 Correct 6 ms 1352 KB Output is correct
13 Correct 4 ms 1352 KB Output is correct
14 Correct 4 ms 1352 KB Output is correct
15 Correct 2 ms 1352 KB Output is correct
16 Correct 6 ms 1352 KB Output is correct
17 Correct 5 ms 1392 KB Output is correct
18 Correct 7 ms 1428 KB Output is correct
19 Correct 8 ms 1820 KB Output is correct
20 Correct 23 ms 4764 KB Output is correct
21 Correct 20 ms 4764 KB Output is correct
22 Correct 200 ms 48292 KB Output is correct
23 Correct 577 ms 119220 KB Output is correct
24 Correct 219 ms 119220 KB Output is correct
25 Correct 520 ms 119280 KB Output is correct
26 Correct 613 ms 119280 KB Output is correct
27 Correct 4 ms 119280 KB Output is correct
28 Correct 3 ms 119280 KB Output is correct
29 Correct 3 ms 119280 KB Output is correct
30 Correct 549 ms 119280 KB Output is correct
31 Correct 518 ms 119280 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 119280 KB Output is correct
2 Correct 7 ms 119280 KB Output is correct
3 Correct 512 ms 119328 KB Output is correct
4 Execution timed out 1095 ms 187696 KB Time limit exceeded
5 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 4 ms 452 KB Output is correct
3 Correct 3 ms 452 KB Output is correct
4 Correct 3 ms 532 KB Output is correct
5 Correct 3 ms 532 KB Output is correct
6 Correct 3 ms 592 KB Output is correct
7 Correct 6 ms 1232 KB Output is correct
8 Correct 5 ms 1232 KB Output is correct
9 Correct 6 ms 1288 KB Output is correct
10 Correct 6 ms 1288 KB Output is correct
11 Correct 6 ms 1352 KB Output is correct
12 Correct 6 ms 1352 KB Output is correct
13 Correct 4 ms 1352 KB Output is correct
14 Correct 4 ms 1352 KB Output is correct
15 Correct 2 ms 1352 KB Output is correct
16 Correct 6 ms 1352 KB Output is correct
17 Correct 5 ms 1392 KB Output is correct
18 Correct 7 ms 1428 KB Output is correct
19 Correct 8 ms 1820 KB Output is correct
20 Correct 23 ms 4764 KB Output is correct
21 Correct 20 ms 4764 KB Output is correct
22 Correct 200 ms 48292 KB Output is correct
23 Correct 577 ms 119220 KB Output is correct
24 Correct 219 ms 119220 KB Output is correct
25 Correct 520 ms 119280 KB Output is correct
26 Correct 613 ms 119280 KB Output is correct
27 Correct 4 ms 119280 KB Output is correct
28 Correct 3 ms 119280 KB Output is correct
29 Correct 3 ms 119280 KB Output is correct
30 Correct 549 ms 119280 KB Output is correct
31 Correct 518 ms 119280 KB Output is correct
32 Correct 2 ms 119280 KB Output is correct
33 Correct 7 ms 119280 KB Output is correct
34 Correct 512 ms 119328 KB Output is correct
35 Execution timed out 1095 ms 187696 KB Time limit exceeded
36 Halted 0 ms 0 KB -