oj.uz

답안 #151710

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
151710 2019-09-04T09:21:18 Z Ruxandra985 Bali Sculptures (APIO15_sculpture) C++14
50 / 100
 93 ms 504 KB 
/// upsi nu e aliens:))
/// ok aparent bv rux dar nu merge dinamica clasica daca ai or:))))
/// ar trebui sa mearga doar pe subtraskurile cu a = 1
#include <cstdio>
#include <iostream>
#define DIMN 2010
#define INF 4000000000000
using namespace std;
int v[DIMN],cnt[DIMN],n;
long long dp[DIMN],sp[DIMN];
int check (long long lambda , long long &sol){ /// sol = dp[n] , return = cnt[n]
    int i,poz,j;
    long long mini;
    for (i=1;i<=n;i++){
        mini = (dp[i-1] | v[i]) + lambda * (cnt[i-1] + 1);
        poz = i-1;
        for (j=i-2;j>=0;j--){
            if (mini > (dp[j] | (sp[i] - sp[j])) + lambda*(cnt[j] + 1)){
                mini = (dp[j] | (sp[i] - sp[j])) + lambda*(cnt[j] + 1);
                poz = j;
            }
        }
        dp[i] = (dp[poz] | (sp[i] - sp[poz]));
        cnt[i] = cnt[poz] + 1;
    }
    sol = dp[n] + lambda * cnt[n];
    return cnt[n];
}
int check2 (long long target){
    int i,j;
    /// daca ai 0 in target , nu poti sa pui tu 1

    for (i=1;i<=n;i++){
        cnt[i] = n + 1;
        for (j=i-1;j>=0;j--){
            if ((target | (sp[i] - sp[j])) <= target){ /// respecta
                cnt[i] = min (cnt[i] , cnt[j] + 1);
            }
        }
    }
    return cnt[n];
}
int main()
{
    FILE *fin = stdin;
    FILE *fout = stdout;
    int a,b,i,x;
    long long sol , solfinal,st,dr,mid,lastok;
    fscanf (fin,"%d%d%d",&n,&a,&b);
    for (i=1;i<=n;i++){
        fscanf (fin,"%d",&v[i]);
        sp[i] = sp[i-1] + v[i];
    }
    if (a!=1){
        solfinal =0;
        for (x=a;x<=b;x++){ /// aliens pe FIX x intervale
            st = -INF/2;
            dr = INF/2;
            while (st<=dr){
                mid = (st + dr)/2;
                sol = 0;
                if (check(mid,sol) > x)
                    st = mid + 1;
                else {
                    lastok = mid;
                    dr = mid - 1;
                }
            }
            sol = 0;
            check (lastok,sol);
            if (x == a)
                solfinal = sol - (long long)x * lastok;
            else solfinal = min (solfinal , sol - (long long)x * lastok);
        }
    }
    else { /// a = 1 , b e idk , deci poti sa selectezi CEL MULT b intervale
        solfinal = 0; /// prefix
        long long bit = ((long long)1<<40);
        for (;bit;bit/=2){
            if (check2(solfinal + bit-1) > b){ /// prefixul stabilit , bit e 0, restul 1
                solfinal = solfinal + bit; /// nu se poate sa ai 0 pe poz bit
            }
        }
    }
    fprintf (fout,"%lld",solfinal);
    return 0;
}

Compilation message

sculpture.cpp: In function 'int main()':
sculpture.cpp:49:12: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     fscanf (fin,"%d%d%d",&n,&a,&b);
     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
sculpture.cpp:51:16: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         fscanf (fin,"%d",&v[i]);
         ~~~~~~~^~~~~~~~~~~~~~~~
sculpture.cpp:70:19: warning: 'lastok' may be used uninitialized in this function [-Wmaybe-uninitialized]
             check (lastok,sol);
             ~~~~~~^~~~~~~~~~~~

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Incorrect 2 ms 376 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 252 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 3 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 252 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 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Incorrect 2 ms 376 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 256 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 256 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 256 KB Output is correct
11 Correct 2 ms 252 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 3 ms 376 KB Output is correct
19 Correct 2 ms 396 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 256 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 252 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 356 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 3 ms 376 KB Output is correct
29 Correct 3 ms 376 KB Output is correct
30 Correct 3 ms 376 KB Output is correct
31 Correct 3 ms 380 KB Output is correct
32 Correct 3 ms 256 KB Output is correct

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 3 ms 256 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 256 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 256 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Incorrect 2 ms 376 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #5
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 380 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 380 KB Output is correct
20 Correct 2 ms 380 KB Output is correct
21 Correct 2 ms 256 KB Output is correct
22 Correct 3 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 3 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 3 ms 376 KB Output is correct
29 Correct 3 ms 376 KB Output is correct
30 Correct 2 ms 256 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 256 KB Output is correct
34 Correct 2 ms 256 KB Output is correct
35 Correct 2 ms 256 KB Output is correct
36 Correct 2 ms 256 KB Output is correct
37 Correct 2 ms 380 KB Output is correct
38 Correct 3 ms 376 KB Output is correct
39 Correct 3 ms 376 KB Output is correct
40 Correct 3 ms 256 KB Output is correct
41 Correct 2 ms 376 KB Output is correct
42 Correct 2 ms 256 KB Output is correct
43 Correct 2 ms 376 KB Output is correct
44 Correct 2 ms 376 KB Output is correct
45 Correct 2 ms 376 KB Output is correct
46 Correct 2 ms 376 KB Output is correct
47 Correct 2 ms 376 KB Output is correct
48 Correct 2 ms 376 KB Output is correct
49 Correct 2 ms 256 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Correct 2 ms 376 KB Output is correct
52 Correct 11 ms 376 KB Output is correct
53 Correct 16 ms 376 KB Output is correct
54 Correct 28 ms 376 KB Output is correct
55 Correct 26 ms 376 KB Output is correct
56 Correct 90 ms 376 KB Output is correct
57 Correct 91 ms 408 KB Output is correct
58 Correct 84 ms 376 KB Output is correct
59 Correct 84 ms 376 KB Output is correct
60 Correct 93 ms 412 KB Output is correct
61 Correct 3 ms 376 KB Output is correct
62 Correct 16 ms 376 KB Output is correct
63 Correct 28 ms 376 KB Output is correct
64 Correct 25 ms 376 KB Output is correct
65 Correct 46 ms 504 KB Output is correct
66 Correct 68 ms 504 KB Output is correct
67 Correct 89 ms 412 KB Output is correct
68 Correct 92 ms 376 KB Output is correct
69 Correct 86 ms 376 KB Output is correct