oj.uz

Submission #58632

# Submission time Handle Problem Language Result Execution time Memory
58632 2018-07-18T14:08:30 Z Benq Nice sequence (IZhO18_sequence) C++14
15 / 100
 19 ms 1392 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;

int T;

vi tri(int N, int M) { // N > M 
    if (N % M == 0) {
        vi z; F0R(i,N-1) z.pb(1);
        return z;
    }
    array<int,3> ans = {-1,-1,-1};
    for (int k = 0; k < N; k += M) {
        int l = max(k-(N-1),-(M-1));
        int r = min(N-1,k+M-1);
        ans = max(ans,{r-l+1,l,r});
        // k-(N-1), -(M-1)
        // N-1, k+M-1
    }
    vi res;
    FOR(i,ans[1],ans[2]+1) {
        if (i % M == 0) res.pb(1);
        else res.pb(-1);
    }
    /*cout << N << " " << M << " " << ans.f << " " << ans.s << "\n";
    exit(0);*/
    pi x = {0,0}; F0R(i,M) if (res[i] == 1) x.f ++; else x.s ++; 
    pi y = {0,0}; F0R(i,N) if (res[i] == 1) y.f ++; else y.s ++; 
    
    // cout << x.f <<
    pi z = {y.s+x.s,y.f+x.f};
    F0R(i,sz(res)) {
        if (res[i] == 1) res[i] *= z.f;
        else res[i] *= z.s;
    }
    return res;
}

vi flip(vi z) {
    F0R(i,sz(z)) z[i] *= -1;
    return z;
}

vi triN(int N, vi z) {
    if (sz(z) < N) return z;
    int tmp = 0; F0R(i,N) tmp += z[i];
    if (tmp > 0) z = flip(z);
    return z;
}

vi triM(int N, vi z) {
    if (sz(z) < N) return z;
    int tmp = 0; F0R(i,N) tmp += z[i];
    if (tmp < 0) z = flip(z);
    return z;
}

bool testN(int M, vi z) {
    F0R(i,sz(z)-M+1) {
        int ret = 0;
        F0R(j,M) ret += z[i+j];
        if (ret >= 0) return 0;
    }
    return 1;
}

bool testM(int M, vi z) {
    F0R(i,sz(z)-M+1) {
        int ret = 0;
        F0R(j,M) ret += z[i+j];
        if (ret <= 0) return 0;
    }
    return 1;
}

void solve() {
    int N,M; cin >> N >> M; // int N = rand() % 10+1,M = rand() % 10+1; // cin >> N >> M;
    vi z = tri(max(N,M),min(M,N));
    
    z = triN(N,z);
    z = triM(M,z);
    
    if (!testN(N,z) || !testM(M,z)) {
        cout << N << " " << M << "\n";
        cout << sz(z) << "\n";
        cout << testN(N,z) << " " << testM(M,z) << "\n";
        for (int i: z) cout << i << " ";
        cout << "\n";
        exit(0);
    }
    cout << sz(z) << "\n";
    for (int i: z) cout << i << " ";
    cout << "\n";
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> T;
    F0R(i,T) solve();
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 248 KB Ok
2 Correct 3 ms 488 KB Ok
3 Correct 3 ms 488 KB Ok
4 Correct 2 ms 536 KB Ok
5 Correct 3 ms 536 KB Ok
6 Correct 4 ms 664 KB Ok
7 Correct 3 ms 664 KB Ok
8 Correct 3 ms 664 KB Ok
9 Correct 3 ms 664 KB Ok
10 Correct 0 ms 664 KB Ok
11 Correct 3 ms 664 KB Ok
12 Correct 3 ms 664 KB Ok

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 664 KB Ok
2 Correct 4 ms 800 KB Ok
3 Correct 2 ms 824 KB Ok
4 Correct 2 ms 860 KB Ok
5 Correct 3 ms 864 KB Ok
6 Correct 5 ms 984 KB Ok
7 Correct 19 ms 1288 KB Ok
8 Correct 8 ms 1288 KB Ok
9 Correct 16 ms 1392 KB Ok
10 Correct 14 ms 1392 KB Ok

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1392 KB Ok
2 Correct 2 ms 1392 KB Ok
3 Correct 2 ms 1392 KB Ok
4 Correct 3 ms 1392 KB Ok
5 Correct 3 ms 1392 KB Ok
6 Incorrect 4 ms 1392 KB Jury has the better answer : jans = 11, pans = 10
7 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 1392 KB Jury has the better answer : jans = 10, pans = 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 248 KB Ok
2 Correct 3 ms 488 KB Ok
3 Correct 3 ms 488 KB Ok
4 Correct 2 ms 536 KB Ok
5 Correct 3 ms 536 KB Ok
6 Correct 4 ms 664 KB Ok
7 Correct 3 ms 664 KB Ok
8 Correct 3 ms 664 KB Ok
9 Correct 3 ms 664 KB Ok
10 Correct 0 ms 664 KB Ok
11 Correct 3 ms 664 KB Ok
12 Correct 3 ms 664 KB Ok
13 Correct 3 ms 1392 KB Ok
14 Correct 2 ms 1392 KB Ok
15 Correct 2 ms 1392 KB Ok
16 Correct 3 ms 1392 KB Ok
17 Correct 3 ms 1392 KB Ok
18 Incorrect 4 ms 1392 KB Jury has the better answer : jans = 11, pans = 10
19 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 248 KB Ok
2 Correct 3 ms 488 KB Ok
3 Correct 3 ms 488 KB Ok
4 Correct 2 ms 536 KB Ok
5 Correct 3 ms 536 KB Ok
6 Correct 4 ms 664 KB Ok
7 Correct 3 ms 664 KB Ok
8 Correct 3 ms 664 KB Ok
9 Correct 3 ms 664 KB Ok
10 Correct 0 ms 664 KB Ok
11 Correct 3 ms 664 KB Ok
12 Correct 3 ms 664 KB Ok
13 Correct 3 ms 664 KB Ok
14 Correct 4 ms 800 KB Ok
15 Correct 2 ms 824 KB Ok
16 Correct 2 ms 860 KB Ok
17 Correct 3 ms 864 KB Ok
18 Correct 5 ms 984 KB Ok
19 Correct 19 ms 1288 KB Ok
20 Correct 8 ms 1288 KB Ok
21 Correct 16 ms 1392 KB Ok
22 Correct 14 ms 1392 KB Ok
23 Correct 3 ms 1392 KB Ok
24 Correct 2 ms 1392 KB Ok
25 Correct 2 ms 1392 KB Ok
26 Correct 3 ms 1392 KB Ok
27 Correct 3 ms 1392 KB Ok
28 Incorrect 4 ms 1392 KB Jury has the better answer : jans = 11, pans = 10
29 Halted 0 ms 0 KB -

Subtask #7
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 248 KB Ok
2 Correct 3 ms 488 KB Ok
3 Correct 3 ms 488 KB Ok
4 Correct 2 ms 536 KB Ok
5 Correct 3 ms 536 KB Ok
6 Correct 4 ms 664 KB Ok
7 Correct 3 ms 664 KB Ok
8 Correct 3 ms 664 KB Ok
9 Correct 3 ms 664 KB Ok
10 Correct 0 ms 664 KB Ok
11 Correct 3 ms 664 KB Ok
12 Correct 3 ms 664 KB Ok
13 Correct 3 ms 664 KB Ok
14 Correct 4 ms 800 KB Ok
15 Correct 2 ms 824 KB Ok
16 Correct 2 ms 860 KB Ok
17 Correct 3 ms 864 KB Ok
18 Correct 5 ms 984 KB Ok
19 Correct 19 ms 1288 KB Ok
20 Correct 8 ms 1288 KB Ok
21 Correct 16 ms 1392 KB Ok
22 Correct 14 ms 1392 KB Ok
23 Correct 3 ms 1392 KB Ok
24 Correct 2 ms 1392 KB Ok
25 Correct 2 ms 1392 KB Ok
26 Correct 3 ms 1392 KB Ok
27 Correct 3 ms 1392 KB Ok
28 Incorrect 4 ms 1392 KB Jury has the better answer : jans = 11, pans = 10
29 Halted 0 ms 0 KB -