oj.uz

Submission #77346

# Submission time Handle Problem Language Result Execution time Memory
77346 2018-09-25T23:54:00 Z duality Global Warming (CEOI18_glo) C++11
100 / 100
 128 ms 3124 KB 
#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------

int t[200000];
vi v[3];
int findAns(int n,int d) {
    int i;
    v[0].clear(),v[1].clear(),v[2].clear();
    v[0].pb(t[0]),v[1].pb(min(t[0],t[0]+d)),v[2].pb(min(t[0],t[0]+d));
    for (i = 1; i < n; i++) {
        int p0 = lower_bound(v[0].begin(),v[0].end(),t[i])-v[0].begin();
        if (p0 == v[0].size()) v[0].pb(t[i]);
        else v[0][p0] = t[i];
        int p1 = lower_bound(v[1].begin(),v[1].end(),t[i]+d)-v[1].begin();
        if (p1 == v[1].size()) v[1].pb(t[i]+d);
        else v[1][p1] = t[i]+d;
        int p2 = lower_bound(v[2].begin(),v[2].end(),t[i])-v[2].begin();
        if (p2 == v[2].size()) v[2].pb(t[i]);
        else v[2][p2] = t[i];
        if ((p0 >= v[1].size()) || (v[0][p0] < v[1][p0])) {
            if (p0 >= v[1].size()) v[1].pb(0);
            v[1][p0] = v[0][p0];
        }
        if ((p1 >= v[2].size()) || (v[1][p1] < v[2][p1])) {
            if (p1 >= v[2].size()) v[2].pb(0);
            v[2][p1] = v[1][p1];
        }
    }
    return v[2].size();
}
int main() {
    int i;
    int n,x;
    scanf("%d %d",&n,&x);
    for (i = 0; i < n; i++) scanf("%d",&t[i]);
    printf("%d\n",max(findAns(n,-x),findAns(n,x)));

    return 0;
}

Compilation message

glo.cpp: In function 'int findAns(int, int)':
glo.cpp:66:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (p0 == v[0].size()) v[0].pb(t[i]);
             ~~~^~~~~~~~~~~~~~
glo.cpp:69:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (p1 == v[1].size()) v[1].pb(t[i]+d);
             ~~~^~~~~~~~~~~~~~
glo.cpp:72:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (p2 == v[2].size()) v[2].pb(t[i]);
             ~~~^~~~~~~~~~~~~~
glo.cpp:74:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if ((p0 >= v[1].size()) || (v[0][p0] < v[1][p0])) {
              ~~~^~~~~~~~~~~~~~
glo.cpp:75:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if (p0 >= v[1].size()) v[1].pb(0);
                 ~~~^~~~~~~~~~~~~~
glo.cpp:78:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if ((p1 >= v[2].size()) || (v[1][p1] < v[2][p1])) {
              ~~~^~~~~~~~~~~~~~
glo.cpp:79:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if (p1 >= v[2].size()) v[2].pb(0);
                 ~~~^~~~~~~~~~~~~~
glo.cpp: In function 'int main()':
glo.cpp:88:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&n,&x);
     ~~~~~^~~~~~~~~~~~~~~
glo.cpp:89:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (i = 0; i < n; i++) scanf("%d",&t[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 372 KB Output is correct
3 Correct 3 ms 576 KB Output is correct
4 Correct 2 ms 576 KB Output is correct
5 Correct 2 ms 576 KB Output is correct
6 Correct 2 ms 576 KB Output is correct
7 Correct 2 ms 576 KB Output is correct
8 Correct 2 ms 576 KB Output is correct
9 Correct 2 ms 576 KB Output is correct
10 Correct 2 ms 576 KB Output is correct
11 Correct 2 ms 616 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 372 KB Output is correct
3 Correct 3 ms 576 KB Output is correct
4 Correct 2 ms 576 KB Output is correct
5 Correct 2 ms 576 KB Output is correct
6 Correct 2 ms 576 KB Output is correct
7 Correct 2 ms 576 KB Output is correct
8 Correct 2 ms 576 KB Output is correct
9 Correct 2 ms 576 KB Output is correct
10 Correct 2 ms 576 KB Output is correct
11 Correct 2 ms 616 KB Output is correct
12 Correct 2 ms 616 KB Output is correct
13 Correct 2 ms 616 KB Output is correct
14 Correct 2 ms 616 KB Output is correct
15 Correct 2 ms 616 KB Output is correct
16 Correct 2 ms 616 KB Output is correct
17 Correct 2 ms 616 KB Output is correct
18 Correct 2 ms 616 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 372 KB Output is correct
3 Correct 3 ms 576 KB Output is correct
4 Correct 2 ms 576 KB Output is correct
5 Correct 2 ms 576 KB Output is correct
6 Correct 2 ms 576 KB Output is correct
7 Correct 2 ms 576 KB Output is correct
8 Correct 2 ms 576 KB Output is correct
9 Correct 2 ms 576 KB Output is correct
10 Correct 2 ms 576 KB Output is correct
11 Correct 2 ms 616 KB Output is correct
12 Correct 2 ms 616 KB Output is correct
13 Correct 2 ms 616 KB Output is correct
14 Correct 2 ms 616 KB Output is correct
15 Correct 2 ms 616 KB Output is correct
16 Correct 2 ms 616 KB Output is correct
17 Correct 2 ms 616 KB Output is correct
18 Correct 2 ms 616 KB Output is correct
19 Correct 2 ms 616 KB Output is correct
20 Correct 3 ms 616 KB Output is correct
21 Correct 3 ms 616 KB Output is correct
22 Correct 2 ms 616 KB Output is correct
23 Correct 2 ms 636 KB Output is correct
24 Correct 3 ms 636 KB Output is correct
25 Correct 2 ms 636 KB Output is correct
26 Correct 2 ms 636 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 1404 KB Output is correct
2 Correct 122 ms 1404 KB Output is correct
3 Correct 128 ms 1508 KB Output is correct
4 Correct 120 ms 1508 KB Output is correct
5 Correct 61 ms 2668 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 2668 KB Output is correct
2 Correct 28 ms 2668 KB Output is correct
3 Correct 28 ms 2668 KB Output is correct
4 Correct 21 ms 2668 KB Output is correct
5 Correct 2 ms 2668 KB Output is correct
6 Correct 17 ms 2668 KB Output is correct
7 Correct 23 ms 2668 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 2668 KB Output is correct
2 Correct 82 ms 2668 KB Output is correct
3 Correct 126 ms 2668 KB Output is correct
4 Correct 70 ms 2792 KB Output is correct
5 Correct 32 ms 2792 KB Output is correct
6 Correct 61 ms 2792 KB Output is correct
7 Correct 50 ms 2792 KB Output is correct
8 Correct 43 ms 2792 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 372 KB Output is correct
3 Correct 3 ms 576 KB Output is correct
4 Correct 2 ms 576 KB Output is correct
5 Correct 2 ms 576 KB Output is correct
6 Correct 2 ms 576 KB Output is correct
7 Correct 2 ms 576 KB Output is correct
8 Correct 2 ms 576 KB Output is correct
9 Correct 2 ms 576 KB Output is correct
10 Correct 2 ms 576 KB Output is correct
11 Correct 2 ms 616 KB Output is correct
12 Correct 2 ms 616 KB Output is correct
13 Correct 2 ms 616 KB Output is correct
14 Correct 2 ms 616 KB Output is correct
15 Correct 2 ms 616 KB Output is correct
16 Correct 2 ms 616 KB Output is correct
17 Correct 2 ms 616 KB Output is correct
18 Correct 2 ms 616 KB Output is correct
19 Correct 2 ms 616 KB Output is correct
20 Correct 3 ms 616 KB Output is correct
21 Correct 3 ms 616 KB Output is correct
22 Correct 2 ms 616 KB Output is correct
23 Correct 2 ms 636 KB Output is correct
24 Correct 3 ms 636 KB Output is correct
25 Correct 2 ms 636 KB Output is correct
26 Correct 2 ms 636 KB Output is correct
27 Correct 121 ms 1404 KB Output is correct
28 Correct 122 ms 1404 KB Output is correct
29 Correct 128 ms 1508 KB Output is correct
30 Correct 120 ms 1508 KB Output is correct
31 Correct 61 ms 2668 KB Output is correct
32 Correct 28 ms 2668 KB Output is correct
33 Correct 28 ms 2668 KB Output is correct
34 Correct 28 ms 2668 KB Output is correct
35 Correct 21 ms 2668 KB Output is correct
36 Correct 2 ms 2668 KB Output is correct
37 Correct 17 ms 2668 KB Output is correct
38 Correct 23 ms 2668 KB Output is correct
39 Correct 58 ms 2668 KB Output is correct
40 Correct 82 ms 2668 KB Output is correct
41 Correct 126 ms 2668 KB Output is correct
42 Correct 70 ms 2792 KB Output is correct
43 Correct 32 ms 2792 KB Output is correct
44 Correct 61 ms 2792 KB Output is correct
45 Correct 50 ms 2792 KB Output is correct
46 Correct 43 ms 2792 KB Output is correct
47 Correct 57 ms 2792 KB Output is correct
48 Correct 59 ms 2792 KB Output is correct
49 Correct 123 ms 2792 KB Output is correct
50 Correct 63 ms 2792 KB Output is correct
51 Correct 91 ms 3124 KB Output is correct
52 Correct 64 ms 3124 KB Output is correct
53 Correct 61 ms 3124 KB Output is correct
54 Correct 54 ms 3124 KB Output is correct
55 Correct 88 ms 3124 KB Output is correct