oj.uz

답안 #336240

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
336240 2020-12-15T03:21:48 Z beksultan04 Bigger segments (IZhO19_segments) C++14
13 / 100
 1500 ms 49900 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define OK puts("OK");
#define fr first
#define sc second
#define ret return
#define scan1(a) scanf("%lld",&a);
#define scan2(a,b) scanf("%lld %lld",&a, &b);
#define scan3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
const int N = 1e6+11,INF=1e9+7;
int q[N],ct[N],der[4*N],ans,n,h1[N],h2[N],h3[N],dp[N];
vector <pii > v[N];
int rec(int j,int sum,int cnt){
    int i;



    if (j > n){
        ret cnt;
    }

    int x1 = j+sum*29;
    x1%=N;

    int x2 = j+sum*31;
    x2%=N;

    int x3 = j+sum*41;
    x3%=N;


    if (h1[x1] == h2[x2] && h2[x2]==h3[x3] && h1[x1] == 1){
        ret dp[j];
    }
    int mx=0;
    for (i=0;i<v[j].size();++i){
        if (v[j][i].fr >= sum){
            mx = max(mx,rec(v[j][i].sc+1,v[j][i].fr,cnt+1));
        }
    }
    ret dp[j]=mx;

}
main(){
    int i,j;
    scan1(n)
    for (i=0;i<N;++i)h1[i]=h2[i]=h3[i]=-1;
    for (i=1;i<=n;++i){
        scan1(q[i])
    }
    for (i=1;i<=n;++i){
        int sum=0;
        for (j=i;j<=n;++j){
            sum+=q[j];
            v[i].pb({sum,j});
        }
    }

    cout <<rec(1,0,0);;
}

Compilation message

segments.cpp: In function 'long long int rec(long long int, long long int, long long int)':
segments.cpp:42:15: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |     for (i=0;i<v[j].size();++i){
      |              ~^~~~~~~~~~~~
segments.cpp: At global scope:
segments.cpp:50:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   50 | main(){
      |      ^
segments.cpp: In function 'int main()':
segments.cpp:9:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    9 | #define scan1(a) scanf("%lld",&a);
      |                  ~~~~~^~~~~~~~~~~
segments.cpp:52:5: note: in expansion of macro 'scan1'
   52 |     scan1(n)
      |     ^~~~~
segments.cpp:9:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    9 | #define scan1(a) scanf("%lld",&a);
      |                  ~~~~~^~~~~~~~~~~
segments.cpp:55:9: note: in expansion of macro 'scan1'
   55 |         scan1(q[i])
      |         ^~~~~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 47340 KB Output is correct
2 Correct 27 ms 47340 KB Output is correct
3 Correct 27 ms 47340 KB Output is correct
4 Correct 30 ms 47340 KB Output is correct
5 Correct 28 ms 47356 KB Output is correct
6 Correct 28 ms 47340 KB Output is correct
7 Correct 28 ms 47340 KB Output is correct
8 Correct 31 ms 47240 KB Output is correct
9 Correct 27 ms 47340 KB Output is correct
10 Correct 27 ms 47340 KB Output is correct
11 Correct 27 ms 47340 KB Output is correct
12 Correct 28 ms 47340 KB Output is correct
13 Correct 29 ms 47340 KB Output is correct
14 Correct 27 ms 47340 KB Output is correct
15 Correct 30 ms 47340 KB Output is correct

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 47340 KB Output is correct
2 Correct 27 ms 47340 KB Output is correct
3 Correct 27 ms 47340 KB Output is correct
4 Correct 30 ms 47340 KB Output is correct
5 Correct 28 ms 47356 KB Output is correct
6 Correct 28 ms 47340 KB Output is correct
7 Correct 28 ms 47340 KB Output is correct
8 Correct 31 ms 47240 KB Output is correct
9 Correct 27 ms 47340 KB Output is correct
10 Correct 27 ms 47340 KB Output is correct
11 Correct 27 ms 47340 KB Output is correct
12 Correct 28 ms 47340 KB Output is correct
13 Correct 29 ms 47340 KB Output is correct
14 Correct 27 ms 47340 KB Output is correct
15 Correct 30 ms 47340 KB Output is correct
16 Correct 34 ms 49900 KB Output is correct
17 Execution timed out 1596 ms 49900 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 47340 KB Output is correct
2 Correct 27 ms 47340 KB Output is correct
3 Correct 27 ms 47340 KB Output is correct
4 Correct 30 ms 47340 KB Output is correct
5 Correct 28 ms 47356 KB Output is correct
6 Correct 28 ms 47340 KB Output is correct
7 Correct 28 ms 47340 KB Output is correct
8 Correct 31 ms 47240 KB Output is correct
9 Correct 27 ms 47340 KB Output is correct
10 Correct 27 ms 47340 KB Output is correct
11 Correct 27 ms 47340 KB Output is correct
12 Correct 28 ms 47340 KB Output is correct
13 Correct 29 ms 47340 KB Output is correct
14 Correct 27 ms 47340 KB Output is correct
15 Correct 30 ms 47340 KB Output is correct
16 Correct 34 ms 49900 KB Output is correct
17 Execution timed out 1596 ms 49900 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 47340 KB Output is correct
2 Correct 27 ms 47340 KB Output is correct
3 Correct 27 ms 47340 KB Output is correct
4 Correct 30 ms 47340 KB Output is correct
5 Correct 28 ms 47356 KB Output is correct
6 Correct 28 ms 47340 KB Output is correct
7 Correct 28 ms 47340 KB Output is correct
8 Correct 31 ms 47240 KB Output is correct
9 Correct 27 ms 47340 KB Output is correct
10 Correct 27 ms 47340 KB Output is correct
11 Correct 27 ms 47340 KB Output is correct
12 Correct 28 ms 47340 KB Output is correct
13 Correct 29 ms 47340 KB Output is correct
14 Correct 27 ms 47340 KB Output is correct
15 Correct 30 ms 47340 KB Output is correct
16 Correct 34 ms 49900 KB Output is correct
17 Execution timed out 1596 ms 49900 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 47340 KB Output is correct
2 Correct 27 ms 47340 KB Output is correct
3 Correct 27 ms 47340 KB Output is correct
4 Correct 30 ms 47340 KB Output is correct
5 Correct 28 ms 47356 KB Output is correct
6 Correct 28 ms 47340 KB Output is correct
7 Correct 28 ms 47340 KB Output is correct
8 Correct 31 ms 47240 KB Output is correct
9 Correct 27 ms 47340 KB Output is correct
10 Correct 27 ms 47340 KB Output is correct
11 Correct 27 ms 47340 KB Output is correct
12 Correct 28 ms 47340 KB Output is correct
13 Correct 29 ms 47340 KB Output is correct
14 Correct 27 ms 47340 KB Output is correct
15 Correct 30 ms 47340 KB Output is correct
16 Correct 34 ms 49900 KB Output is correct
17 Execution timed out 1596 ms 49900 KB Time limit exceeded
18 Halted 0 ms 0 KB -