Submission #95691

# Submission time Handle Problem Language Result Execution time Memory
95691 2019-02-02T07:44:04 Z jeff Gap (APIO16_gap) C++14
70 / 100
231 ms 2424 KB
#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
 
inline unsigned long long mde(unsigned long long a, unsigned long long b, unsigned long long c) {
    unsigned long long t = 0, y = 0, z = 0, i;
    stack<unsigned long long> st;
    while (b) st.push(b % 2), b /= 2;
    while (!st.empty()) {
        z <<= 1;
        y <<= 1;
        z += a * st.top();
        st.pop();
        y += z / (1LL << 62);
        z %= (1LL << 62);
    }
    t += y / c;
    y %= c;
    for (i = 0; i < 62; ++i) {
        y <<= 1;
        z <<= 1;
        t <<= 1;
        y += z / (1LL << 62);
        z %= (1LL << 62);
        t += y / c;
        y %= c;
    }
    return t;
}
 
vector<long long> v;
 
long long findGap(int T, int N) {
    long long l, r, y, z, ls = -1, rs = 0, a, b = 0, i;
    if (T == 1) {
        l = 0;
        r = 1000000000000000000;
        while (l <= r) {
            MinMax(l, r, &a, &b);
         	if (a < 0 &&  b < 0) break;
            v.push_back(a);
            v.push_back(b);
            l = a + 1;
            r = b - 1;
        }
        sort(v.begin(), v.end());
        for (i = 1; i < v.size(); ++i) rs = max(rs, v[i] - v[i - 1]);
        return rs;
    }
    MinMax(0, 1000000000000000000, &y, &z);
    for (i = 0; i < N - 1; ++i) {
        a = y + mde(z - y, i, N - 1);
        b = y + mde(z - y, i + 1, N - 1) - 1;
        if (a >= b) continue;
        MinMax(a, b, &l, &r);
        if (l < 0 && r < 0) continue;
        if (ls > -1) rs = max(rs, l - ls);
        ls = r;
    }
	return max(rs, z - ls);
}

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:47:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (i = 1; i < v.size(); ++i) rs = max(rs, v[i] - v[i - 1]);
                     ~~^~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 252 KB Output is correct
4 Correct 2 ms 292 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Incorrect 2 ms 376 KB Output isn't correct
7 Incorrect 2 ms 352 KB Output isn't correct
8 Incorrect 2 ms 348 KB Output isn't correct
9 Incorrect 2 ms 376 KB Output isn't correct
10 Correct 2 ms 376 KB Output is correct
11 Incorrect 2 ms 376 KB Output isn't correct
12 Incorrect 3 ms 376 KB Output isn't correct
13 Incorrect 3 ms 376 KB Output isn't correct
14 Incorrect 2 ms 376 KB Output isn't correct
15 Incorrect 2 ms 348 KB Output isn't correct
16 Incorrect 14 ms 888 KB Output isn't correct
17 Incorrect 14 ms 888 KB Output isn't correct
18 Incorrect 15 ms 1004 KB Output isn't correct
19 Incorrect 14 ms 888 KB Output isn't correct
20 Correct 11 ms 888 KB Output is correct
21 Incorrect 51 ms 2316 KB Output isn't correct
22 Incorrect 51 ms 2424 KB Output isn't correct
23 Incorrect 50 ms 2296 KB Output isn't correct
24 Incorrect 104 ms 2260 KB Output isn't correct
25 Incorrect 43 ms 2320 KB Output isn't correct
26 Incorrect 49 ms 2248 KB Output isn't correct
27 Incorrect 49 ms 2288 KB Output isn't correct
28 Incorrect 50 ms 2292 KB Output isn't correct
29 Incorrect 118 ms 2336 KB Output isn't correct
30 Correct 39 ms 2328 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
# 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
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 380 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 56 ms 580 KB Output is correct
17 Correct 57 ms 576 KB Output is correct
18 Correct 57 ms 504 KB Output is correct
19 Correct 57 ms 504 KB Output is correct
20 Correct 48 ms 580 KB Output is correct
21 Correct 226 ms 1160 KB Output is correct
22 Correct 231 ms 1164 KB Output is correct
23 Correct 226 ms 1156 KB Output is correct
24 Correct 227 ms 1172 KB Output is correct
25 Correct 219 ms 1144 KB Output is correct
26 Correct 226 ms 1160 KB Output is correct
27 Correct 230 ms 1164 KB Output is correct
28 Correct 225 ms 1224 KB Output is correct
29 Correct 230 ms 1272 KB Output is correct
30 Correct 198 ms 1272 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct