oj.uz

Submission #154641

# Submission time Handle Problem Language Result Execution time Memory
154641 2019-09-23T12:21:31 Z jacynkaa Bali Sculptures (APIO15_sculpture) C++14
50 / 100
 143 ms 23288 KB 
#include <bits/stdc++.h>
#include <math.h>
#include <chrono>
using namespace std;
#pragma GCC optimize("-O3")
#define endl "\n"
#define mp make_pair
#define st first
#define nd second
#define pii pair<int, int>
#define pb push_back
#define _upgrade ios_base::sync_with_stdio(0), cout.setf(ios::fixed), cout.precision(10) //cin.tie(0); cout.tie(0);
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FWD(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define fwd(i, a, b) for (int i = (a); i < (b); ++i)
#define all(c) (c).begin(), (c).end()
#define what(x) cerr << #x << " is " << x << endl;
#define int long long

const int MAXN = 2e3 + 10;
const int MAXK = 44; //UWAGA

unsigned int E[MAXN][MAXN];
int n, a, b;
int tab[MAXN];
pii dist[MAXN];
int shortest[MAXN];
bitset<MAXN> wszystkie[MAXN];

void mini(pii A, pii &B)
{
    B.st = min(B.st, A.st + 1);
    B.nd = max(B.nd, A.nd + 1);
}

bool solveHeura(int q) //czy wynik zawiera sie na inkluzje w q
{
    fill(dist, dist + MAXN, mp(100000, -100000));
    dist[0] = {0, 0};

    rep(i, n) for (int k = i + 1; k <= n; k++)
    {
        if ((E[i][k] | q) == q)
            mini(dist[i], dist[k]);
    }
    //bitset<64> D(q);
    //cerr << D << " " << dist[n].st << " " << dist[n].nd << endl;
    return (dist[n].st <= b && dist[n].nd >= a);
}

bool solveShortest(int q)
{
    fill(shortest, shortest + MAXN, 1e9);
    shortest[0] = 0;
    rep(i, n) for (int k = i + 1; k <= n; k++)
    {
        if ((E[i][k] | q) == q)
            shortest[k] = min(shortest[k], shortest[i] + 1);
    }
    //cerr << shortest[n] << endl;
    return shortest[n] <= b;
}

bool solveBitset(int q)
{
    rep(i, n + 1) wszystkie[i].reset();
    wszystkie[0][0] = true;
    rep(i, n) for (int k = i + 1; k <= n; k++)
    {
        if ((E[i][k] | q) == q)
            wszystkie[k] = (wszystkie[k] | (wszystkie[i] << 1));
    }
    for (int i = a; i <= b; i++)
        if (wszystkie[n][i])
            return true;
    return false;
}

void Heura(int &wynik)
{
    for (int k = MAXK; k >= 0; k--)
        if (!solveHeura(wynik + (1ll << k) - 1))
            wynik += (1ll << k);
}

void wzorShortest(int &wynik)
{
    for (int k = MAXK; k >= 0; k--)
        if (!solveShortest(wynik + (1ll << k) - 1))
            wynik += (1ll << k);
}

void wzorBitset(int &wynik)
{
    for (int k = MAXK; k >= 0; k--)
        if (!solveBitset(wynik + (1ll << k) - 1))
            wynik += (1ll << k);
}

void wzor(int &wynik)
{
    // if (a == 1)
    wzorShortest(wynik);
    // else
    //  wzorBitset(wynik);
}

void slow(int &wynik)
{
    int x = accumulate(tab, tab + n, 0) + 2;
    rep(i, x) if ((a == 1) ? solveShortest(i) : solveBitset(i))
    {
        wynik = i;
        return;
    }
}

void brut(int &wynik)
{
    wynik = 1e18;
    rep(S, (1ll << (n - 1)))
    {
        int xoor = 0;
        vector<int> X(1, -1);
        rep(j, n - 1) if (S & (1ll << j)) X.pb(j);

        if (X.size() >= a && X.size() <= b)
        {
            X.push_back(n - 1);
            rep(j, X.size() - 1)
            {
                int suum = 0;
                for (int l = X[j] + 1; l <= X[j + 1]; l++)
                    suum += tab[l];
                xoor = xoor | suum;
            }
            wynik = min(wynik, xoor);
        }
    }
}

void pre()
{
    cin >> n >> a >> b;
    rep(i, n) cin >> tab[i];

    rep(i, n)
    {
        int val = tab[i];
        for (int k = i + 1; k <= n; k++)
        {
            E[i][k] = val;
            val += tab[k];
        }
    }
}

main()
{
    _upgrade;
    pre();
    int wynik = 0;
    //Huera(wynik);
    //wzorShortest(wynik);
    //wzorBitset(wynik);
    //slow(wynik);
    //brut(wynik);
    wzor(wynik);
    cout << wynik << endl;
}

Compilation message

sculpture.cpp: In function 'bool solveHeura(long long int)':
sculpture.cpp:44:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if ((E[i][k] | q) == q)
             ~~~~~~~~~~~~~~^~~~
sculpture.cpp: In function 'bool solveShortest(long long int)':
sculpture.cpp:58:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if ((E[i][k] | q) == q)
             ~~~~~~~~~~~~~~^~~~
sculpture.cpp: In function 'bool solveBitset(long long int)':
sculpture.cpp:71:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if ((E[i][k] | q) == q)
             ~~~~~~~~~~~~~~^~~~
sculpture.cpp: In function 'void brut(long long int&)':
sculpture.cpp:128:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (X.size() >= a && X.size() <= b)
             ~~~~~~~~~^~~~
sculpture.cpp:128:39: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (X.size() >= a && X.size() <= b)
                              ~~~~~~~~~^~~~
sculpture.cpp:15:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define rep(i, n) for (int i = 0; i < (n); ++i)
                                     ^
sculpture.cpp:131:13: note: in expansion of macro 'rep'
             rep(j, X.size() - 1)
             ^~~
sculpture.cpp: At global scope:
sculpture.cpp:159:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main()
      ^

Subtask #1
0 / 9.0

# 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 508 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Incorrect 3 ms 376 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 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 3 ms 376 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 476 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Incorrect 2 ms 376 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 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 380 KB Output is correct
5 Correct 2 ms 388 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 504 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 376 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 3 ms 504 KB Output is correct
17 Correct 3 ms 632 KB Output is correct
18 Correct 2 ms 632 KB Output is correct
19 Correct 3 ms 632 KB Output is correct
20 Correct 3 ms 632 KB Output is correct
21 Correct 3 ms 508 KB Output is correct
22 Correct 2 ms 632 KB Output is correct
23 Correct 2 ms 632 KB Output is correct
24 Correct 2 ms 632 KB Output is correct
25 Correct 3 ms 632 KB Output is correct
26 Correct 3 ms 760 KB Output is correct
27 Correct 3 ms 760 KB Output is correct
28 Correct 3 ms 760 KB Output is correct
29 Correct 3 ms 888 KB Output is correct
30 Correct 3 ms 888 KB Output is correct
31 Correct 3 ms 760 KB Output is correct
32 Correct 4 ms 888 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 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 3 ms 392 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 432 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 248 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 2 ms 392 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Incorrect 2 ms 376 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #5
29.0 / 29.0

# 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 504 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 380 KB Output is correct
12 Correct 2 ms 476 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 424 KB Output is correct
15 Correct 2 ms 424 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 504 KB Output is correct
19 Correct 2 ms 504 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 380 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 504 KB Output is correct
25 Correct 2 ms 504 KB Output is correct
26 Correct 2 ms 504 KB Output is correct
27 Correct 3 ms 504 KB Output is correct
28 Correct 2 ms 552 KB Output is correct
29 Correct 3 ms 504 KB Output is correct
30 Correct 2 ms 504 KB Output is correct
31 Correct 2 ms 504 KB Output is correct
32 Correct 3 ms 504 KB Output is correct
33 Correct 2 ms 504 KB Output is correct
34 Correct 2 ms 632 KB Output is correct
35 Correct 2 ms 632 KB Output is correct
36 Correct 3 ms 760 KB Output is correct
37 Correct 3 ms 760 KB Output is correct
38 Correct 3 ms 812 KB Output is correct
39 Correct 3 ms 760 KB Output is correct
40 Correct 3 ms 760 KB Output is correct
41 Correct 3 ms 812 KB Output is correct
42 Correct 3 ms 760 KB Output is correct
43 Correct 3 ms 632 KB Output is correct
44 Correct 3 ms 644 KB Output is correct
45 Correct 3 ms 760 KB Output is correct
46 Correct 3 ms 760 KB Output is correct
47 Correct 3 ms 804 KB Output is correct
48 Correct 3 ms 760 KB Output is correct
49 Correct 3 ms 760 KB Output is correct
50 Correct 3 ms 744 KB Output is correct
51 Correct 3 ms 760 KB Output is correct
52 Correct 14 ms 3960 KB Output is correct
53 Correct 23 ms 5624 KB Output is correct
54 Correct 36 ms 8440 KB Output is correct
55 Correct 34 ms 8312 KB Output is correct
56 Correct 142 ms 23032 KB Output is correct
57 Correct 143 ms 23032 KB Output is correct
58 Correct 138 ms 23148 KB Output is correct
59 Correct 132 ms 23032 KB Output is correct
60 Correct 138 ms 23032 KB Output is correct
61 Correct 3 ms 760 KB Output is correct
62 Correct 20 ms 5728 KB Output is correct
63 Correct 36 ms 8312 KB Output is correct
64 Correct 33 ms 8312 KB Output is correct
65 Correct 61 ms 13944 KB Output is correct
66 Correct 96 ms 19192 KB Output is correct
67 Correct 129 ms 23160 KB Output is correct
68 Correct 127 ms 23288 KB Output is correct
69 Correct 127 ms 23144 KB Output is correct