oj.uz

Submission #100105

# Submission time Handle Problem Language Result Execution time Memory
100105 2019-03-09T08:31:08 Z shafinalam Global Warming (CEOI18_glo) C++14
100 / 100
 88 ms 4736 KB 
#include <bits/stdc++.h>

using namespace std;

const int mx = 2e5+5;
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
typedef pair<int,int>pii;
typedef pair<int,pii>piii;

#define  sf scanf
#define  pf printf

#define  input freopen("input.txt","r",stdin)
#define  output freopen("output.txt","w",stdout)

#define  inf 1e16
#define  ff first
#define  ss second
#define  MP make_pair
#define  pb push_back
#define  all(v) v.begin(), v.end()
#define  printcase(cases) printf("Case %d:", cases);
#define  Unique(a) a.erase(unique(a.begin(),a.end()),a.end())
#define  FAST  ios_base::sync_with_stdio(0);cout.tie(0)
#define  endl printf("\n")
#define  __lcm(a, b) ((a*b)/__gcd(a, b))

int  Set(int N,int pos){return N=N | (1<<pos);}
int  reset(int N,int pos){return N= N & ~(1<<pos);}
bool check(int N,int pos){return (bool)(N & (1<<pos));}

int suf[mx];
int arr[mx];
int n, x;

void LDS()
{
    vector<int>v;
    for(int i = 0; i < n; i++) v.push_back(0);
    for(int i = n-1; i >= 0; i--)
    {
        int it = upper_bound(all(v), arr[i])-v.begin()-1;
        v[it] = arr[i];
        suf[i] = n-it;
    }
}
void LIS()
{
    int ans = 0;
    vector<int>v;
    for(int i = 0; i < n; i++)
    {
        int pos = lower_bound(all(v), arr[i]+x)-v.begin();
        ans = max(ans, suf[i]+pos);
        auto it = lower_bound(all(v), arr[i]);
        if(it==v.end()) v.push_back(arr[i]);
        else v[it-v.begin()] = arr[i];
    }
    pf("%d\n", ans);
}
int main()
{
    sf("%d%d", &n, &x);

    for(int i = 0; i < n; i++) sf("%d", &arr[i]);
    LDS();
    LIS();
    return 0;
}

Compilation message

glo.cpp: In function 'int main()':
glo.cpp:65:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     sf("%d%d", &n, &x);
       ^
glo.cpp:67:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i = 0; i < n; i++) sf("%d", &arr[i]);
                                  ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 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 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 3 ms 256 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 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 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 3 ms 256 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 2 ms 256 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 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 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 3 ms 256 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 12 ms 356 KB Output is correct
21 Correct 3 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 3 ms 384 KB Output is correct
24 Correct 3 ms 384 KB Output is correct
25 Correct 3 ms 384 KB Output is correct
26 Correct 2 ms 300 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 4736 KB Output is correct
2 Correct 70 ms 4716 KB Output is correct
3 Correct 69 ms 4716 KB Output is correct
4 Correct 72 ms 4716 KB Output is correct
5 Correct 45 ms 4076 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 1532 KB Output is correct
2 Correct 19 ms 1532 KB Output is correct
3 Correct 19 ms 1532 KB Output is correct
4 Correct 21 ms 1268 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 20 ms 1276 KB Output is correct
7 Correct 15 ms 1660 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 2544 KB Output is correct
2 Correct 34 ms 2524 KB Output is correct
3 Correct 66 ms 4720 KB Output is correct
4 Correct 50 ms 3948 KB Output is correct
5 Correct 25 ms 2160 KB Output is correct
6 Correct 48 ms 3844 KB Output is correct
7 Correct 44 ms 4484 KB Output is correct
8 Correct 30 ms 2552 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 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 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 3 ms 256 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 12 ms 356 KB Output is correct
21 Correct 3 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 3 ms 384 KB Output is correct
24 Correct 3 ms 384 KB Output is correct
25 Correct 3 ms 384 KB Output is correct
26 Correct 2 ms 300 KB Output is correct
27 Correct 69 ms 4736 KB Output is correct
28 Correct 70 ms 4716 KB Output is correct
29 Correct 69 ms 4716 KB Output is correct
30 Correct 72 ms 4716 KB Output is correct
31 Correct 45 ms 4076 KB Output is correct
32 Correct 18 ms 1532 KB Output is correct
33 Correct 19 ms 1532 KB Output is correct
34 Correct 19 ms 1532 KB Output is correct
35 Correct 21 ms 1268 KB Output is correct
36 Correct 3 ms 384 KB Output is correct
37 Correct 20 ms 1276 KB Output is correct
38 Correct 15 ms 1660 KB Output is correct
39 Correct 33 ms 2544 KB Output is correct
40 Correct 34 ms 2524 KB Output is correct
41 Correct 66 ms 4720 KB Output is correct
42 Correct 50 ms 3948 KB Output is correct
43 Correct 25 ms 2160 KB Output is correct
44 Correct 48 ms 3844 KB Output is correct
45 Correct 44 ms 4484 KB Output is correct
46 Correct 30 ms 2552 KB Output is correct
47 Correct 35 ms 2540 KB Output is correct
48 Correct 41 ms 2548 KB Output is correct
49 Correct 68 ms 4688 KB Output is correct
50 Correct 52 ms 4076 KB Output is correct
51 Correct 43 ms 3204 KB Output is correct
52 Correct 60 ms 4116 KB Output is correct
53 Correct 53 ms 4188 KB Output is correct
54 Correct 55 ms 4716 KB Output is correct
55 Correct 88 ms 4716 KB Output is correct