oj.uz

Submission #77344

# Submission time Handle Problem Language Result Execution time Memory
77344 2018-09-25T23:50:56 Z duality Global Warming (CEOI18_glo) C++11
37 / 100
 2000 ms 2628 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 main() {
    int i;
    int n,x;
    scanf("%d %d",&n,&x);
    for (i = 0; i < n; i++) scanf("%d",&t[i]);

    int d;
    int ans = 0;
    for (d = -x;;) {
        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];
            }
        }
        ans = max(ans,(int) v[2].size());
        v[0].clear(),v[1].clear(),v[2].clear();
        if (d == -x) d = x;
        else break;
    }
    printf("%d\n",ans);

    return 0;
}

Compilation message

glo.cpp: In function 'int main()':
glo.cpp:72:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if (p0 == v[0].size()) v[0].pb(t[i]);
                 ~~~^~~~~~~~~~~~~~
glo.cpp:75:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if (p1 == v[1].size()) v[1].pb(t[i]+d);
                 ~~~^~~~~~~~~~~~~~
glo.cpp:78:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if (p2 == v[2].size()) v[2].pb(t[i]);
                 ~~~^~~~~~~~~~~~~~
glo.cpp:80:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if ((p0 >= v[1].size()) || (v[0][p0] < v[1][p0])) {
                  ~~~^~~~~~~~~~~~~~
glo.cpp:81:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 if (p0 >= v[1].size()) v[1].pb(0);
                     ~~~^~~~~~~~~~~~~~
glo.cpp:84:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if ((p1 >= v[2].size()) || (v[1][p1] < v[2][p1])) {
                  ~~~^~~~~~~~~~~~~~
glo.cpp:85:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 if (p1 >= v[2].size()) v[2].pb(0);
                     ~~~^~~~~~~~~~~~~~
glo.cpp:63: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:64: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
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 2 ms 484 KB Output is correct
5 Correct 2 ms 484 KB Output is correct
6 Correct 2 ms 484 KB Output is correct
7 Correct 2 ms 484 KB Output is correct
8 Execution timed out 2062 ms 596 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 2 ms 484 KB Output is correct
5 Correct 2 ms 484 KB Output is correct
6 Correct 2 ms 484 KB Output is correct
7 Correct 2 ms 484 KB Output is correct
8 Execution timed out 2062 ms 596 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 2 ms 484 KB Output is correct
5 Correct 2 ms 484 KB Output is correct
6 Correct 2 ms 484 KB Output is correct
7 Correct 2 ms 484 KB Output is correct
8 Execution timed out 2062 ms 596 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2058 ms 1316 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 1316 KB Output is correct
2 Correct 38 ms 1316 KB Output is correct
3 Correct 27 ms 1316 KB Output is correct
4 Correct 29 ms 1316 KB Output is correct
5 Correct 2 ms 1316 KB Output is correct
6 Correct 28 ms 1316 KB Output is correct
7 Correct 31 ms 1316 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 1316 KB Output is correct
2 Correct 60 ms 1316 KB Output is correct
3 Correct 152 ms 1432 KB Output is correct
4 Correct 71 ms 2628 KB Output is correct
5 Correct 56 ms 2628 KB Output is correct
6 Correct 103 ms 2628 KB Output is correct
7 Correct 63 ms 2628 KB Output is correct
8 Correct 44 ms 2628 KB Output is correct

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 2 ms 484 KB Output is correct
5 Correct 2 ms 484 KB Output is correct
6 Correct 2 ms 484 KB Output is correct
7 Correct 2 ms 484 KB Output is correct
8 Execution timed out 2062 ms 596 KB Time limit exceeded
9 Halted 0 ms 0 KB -