oj.uz

Submission #121317

# Submission time Handle Problem Language Result Execution time Memory
121317 2019-06-26T10:19:25 Z BThero Fibonacci representations (CEOI18_fib) C++17
25 / 100
 9 ms 512 KB 
// Why am I so dumb? :c
// chrono::system_clock::now().time_since_epoch().count()

//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

#define pb push_back
#define mp make_pair

#define all(x) (x).begin(), (x).end()

#define fi first
#define se second

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;   
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const int MOD = (int)1e9 + 7;

int dp[2][205];

int cnt[205];

int n;

int addMod(int a, int b, int m = MOD) {
    a += b;

    if (m <= a) {
        a -= m;
    }

    return a;
}

int mulMod(int a, int b, int m = MOD) {
    return a * 1ll * b % m;
}

int binPow(int a, int b) {
    int ret = 1;

    while (b > 0) {
        if (b & 1) {
            ret = mulMod(ret, a);
        }

        a = mulMod(a, a);
        b >>= 1;
    }

    return ret;
}

void rec() {
    int pos = -1;

    for (int i = 1; i <= 200; ++i) {
        if (cnt[i] == 2) {
            pos = i;
        }
    }

    if (pos == -1) {
        return;            
    }

    if (pos == 1) {
        if (cnt[2] == 0) {
            cnt[2] = 1;
            cnt[1] = 0;
        }
        else {
            --cnt[1];
            --cnt[2];
            ++cnt[3];
            rec();
        }
    }
    else if (pos == 2) {
        --cnt[2];
        cnt[1] += 2;
        --cnt[1];
        --cnt[2];
        ++cnt[3];
        rec();        
    }
    else {
        --cnt[pos];
        ++cnt[pos - 1];
        ++cnt[pos - 2];
        --cnt[pos - 1];
        --cnt[pos];
        ++cnt[pos + 1];
        rec();
    }
}

void norm() {
    for (int step = 1; step <= 200; ++step) {
        for (int i = 200; i > 1; --i) {
            if (cnt[i] == 1 && cnt[i - 1] == 1) {
                cnt[i + 1] = 1;
                cnt[i] = 0;
                cnt[i - 1] = 0;
            }
        }
    }
}

void solve() {
    scanf("%d", &n);
    set<int> S;
    
    for (int i = 1; i <= n; ++i) {
        int x;
        scanf("%d", &x);

        ++cnt[x];
        rec();
        norm();  

        S.clear();

        for (int j = 1; j <= 200; ++j) {
            if (j <= 10 && 0) {
                printf("%d ", cnt[j]);
            }

            if (cnt[j]) {                
                S.insert(j);
            }
        }

        //printf("\n");

        dp[0][0] = 1;
        int prev = 0, ptr = 0;
                              
        for (int cur : S) {
            ++ptr;
            dp[0][ptr] = addMod(dp[0][ptr - 1], dp[1][ptr - 1]);
            dp[1][ptr] = mulMod(dp[0][ptr - 1], (cur - prev - 1) / 2);
            dp[1][ptr] = addMod(dp[1][ptr], mulMod(dp[1][ptr - 1], (cur - prev) / 2));
            prev = cur;                    
        }                                                                                  

        printf("%d\n", addMod(dp[0][ptr], dp[1][ptr]));
    }
}

int main() {
    //freopen("fast.txt", "w", stdout);
    int tt = 1;

    while (tt--) {
        solve();
    }

    return 0;
}

Compilation message

fib.cpp: In function 'void solve()':
fib.cpp:119:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
fib.cpp:124:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &x);
         ~~~~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 3 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 384 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 3 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 4 ms 256 KB Output is correct
8 Correct 9 ms 256 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 9 ms 384 KB Output is correct
11 Correct 7 ms 256 KB Output is correct
12 Correct 5 ms 384 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 3 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 4 ms 256 KB Output is correct
8 Correct 9 ms 256 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 9 ms 384 KB Output is correct
11 Correct 7 ms 256 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Runtime error 3 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
14 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 384 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 3 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 4 ms 256 KB Output is correct
8 Correct 9 ms 256 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 9 ms 384 KB Output is correct
11 Correct 7 ms 256 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Runtime error 3 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
14 Halted 0 ms 0 KB -