网易有道C++后端9.8秋招笔试题

时间 2018.9.8 C++后端

第一题

int main() {
    cin >> x;
    INT_64 cnt = x / 5;
    if (x % 5) cnt += 1;
    cout << cnt << endl;
}

第二题

int main() {
    cin >> T;
    FOR(t, T) {
        cin >> N >> M;
        if (N < M) {
            INT_64 tmp = N;
            N = M;
            M = tmp;
        }
        INT_64 out;
        if (N == 1) out = 1;
        else if (N == 2) out = 0;
        else if (M == 2) out = 0;
        else if (M == 1) out = N-2;
        else out = (M - 2)*(N - 2);
        cout << out << endl;
    }
}

第三题

typedef long long INT_64;

INT_64 T,N,M;

#define FOR(i,n) for(INT_64 i=0;i<n;++i)


#define MAXN (200001)
INT_64 a[MAXN];
INT_64 b[MAXN];

INT_64 query(INT_64 k) {
    return b[k-1]-a[k-1];
}
int nextNoFull[MAXN];
bool isFull[MAXN];
int findNextNoFull(INT_64 x) {
    int next;
    next = nextNoFull[x];
    while (isFull[next] == true) {
        next = nextNoFull[next];
    }
    nextNoFull[x] = next;
    return next;
}
void addToX(INT_64 x, INT_64 v) {
    x = x - 1;
    INT_64 now = x;
    INT_64 rest = v;
    while (rest != 0) {
        if (isFull[now]) now = nextNoFull[now];

        if (now == N) break;//到地板了
        INT_64 tmp = a[now] - rest;
        if (tmp < 0) {
            tmp = a[now];
        }
        else tmp = rest;

        //更新a
        a[now] -= tmp;
        rest -= tmp;
        //更新full
        if (a[now] == 0) isFull[now] = true;
    }
}


int main() {
    cin >> N >> M;
    FOR(i, N) cin >> a[i];
    FOR(i, N) b[i]= a[i];
    FOR(i, N+1) isFull[i]=false;
    FOR(i, N) nextNoFull[i] = i+1;
    char c;
    INT_64 x, v,k;
    FOR(m, M) {
        cin >> c;
        if (c == '1') {
            cin >> k;
            cout << query(k) << endl;
        }
        else {
            cin >> x >> v;
            addToX(x, v);
        }
    }
    return 0;

}