oj.uz

Submission #399465

# Submission time Handle Problem Language Result Execution time Memory
399465 2021-05-05T20:43:40 Z duality Cultivation (JOI17_cultivation) C++11
5 / 100
 2000 ms 262148 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 S[300],E[300];
int main() {
    int i;
    int R,C,N;
    scanf("%d %d %d",&R,&C,&N);
    for (i = 0; i < N; i++) scanf("%d %d",&S[i],&E[i]),S[i]--,E[i]--;

    int j,k,l,m,n;
    LLI ans = 1e10;
    for (int r = 0; r < C; r++) {
        for (int u = 0; u < R; u++) {
            vi dd;
            for (k = 0; k < R; k++) dd.pb(k);
            sort(dd.begin(),dd.end());
            dd.resize(unique(dd.begin(),dd.end())-dd.begin());
            for (k = 0; k < dd.size(); k++) {
                int d = dd[k];
                int L = 0;
                vi poss;
                vector<pair<int,pair<int,pii> > > vv;
                poss.pb(0),poss.pb(C);
                for (m = 0; m < N; m++) {
                    poss.pb(E[m]),poss.pb(min(E[m]+r+1,C));
                    vv.pb(mp(max(S[m]-u,0),mp(-1,mp(E[m],min(E[m]+r+1,C)))));
                    vv.pb(mp(min(S[m]+d+1,R),mp(1,mp(E[m],min(E[m]+r+1,C)))));
                }
                sort(poss.begin(),poss.end());
                poss.resize(unique(poss.begin(),poss.end())-poss.begin());
                int temp[100];
                fill(temp,temp+poss.size(),0);
                sort(vv.begin(),vv.end());
                for (m = 0; m < vv.size(); m++) {
                    int s = lower_bound(poss.begin(),poss.end(),vv[m].second.second.first)-poss.begin();
                    int e = lower_bound(poss.begin(),poss.end(),vv[m].second.second.second)-poss.begin();
                    for (n = s; n < e; n++) temp[n] -= vv[m].second.first;
                    if ((m < vv.size()-1) && (vv[m].first < vv[m+1].first)) {
                        int last = 2e9;
                        for (n = poss.size()-2; n >= 0; n--) {
                            if (temp[n] > 0) last = poss[n];
                            else L = max(L,last-poss[n]);
                        }
                    }
                }
                if (vv[0].first != 0) L = 2e9;
                if (vv.back().first != R) L = 2e9;
                ans = min(ans,(LLI) r+u+L+d);
            }
        }
    }
    printf("%lld\n",ans);

    return 0;
}

Compilation message

cultivation.cpp: In function 'int main()':
cultivation.cpp:73:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |             for (k = 0; k < dd.size(); k++) {
      |                         ~~^~~~~~~~~~~
cultivation.cpp:89:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, std::pair<int, int> > > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   89 |                 for (m = 0; m < vv.size(); m++) {
      |                             ~~^~~~~~~~~~~
cultivation.cpp:93:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, std::pair<int, int> > > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |                     if ((m < vv.size()-1) && (vv[m].first < vv[m+1].first)) {
      |                          ~~^~~~~~~~~~~~~
cultivation.cpp:65:9: warning: unused variable 'j' [-Wunused-variable]
   65 |     int j,k,l,m,n;
      |         ^
cultivation.cpp:65:13: warning: unused variable 'l' [-Wunused-variable]
   65 |     int j,k,l,m,n;
      |             ^
cultivation.cpp:62:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   62 |     scanf("%d %d %d",&R,&C,&N);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~
cultivation.cpp:63:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   63 |     for (i = 0; i < N; i++) scanf("%d %d",&S[i],&E[i]),S[i]--,E[i]--;
      |                             ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 296 KB Output is correct
16 Correct 1 ms 204 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 296 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 12 ms 304 KB Output is correct
18 Correct 245 ms 204 KB Output is correct
19 Correct 269 ms 280 KB Output is correct
20 Correct 14 ms 308 KB Output is correct
21 Correct 484 ms 204 KB Output is correct
22 Correct 1967 ms 296 KB Output is correct
23 Correct 381 ms 324 KB Output is correct
24 Execution timed out 2087 ms 204 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 296 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 12 ms 304 KB Output is correct
18 Correct 245 ms 204 KB Output is correct
19 Correct 269 ms 280 KB Output is correct
20 Correct 14 ms 308 KB Output is correct
21 Correct 484 ms 204 KB Output is correct
22 Correct 1967 ms 296 KB Output is correct
23 Correct 381 ms 324 KB Output is correct
24 Execution timed out 2087 ms 204 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Runtime error 285 ms 262148 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 285 ms 262148 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 296 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 12 ms 304 KB Output is correct
18 Correct 245 ms 204 KB Output is correct
19 Correct 269 ms 280 KB Output is correct
20 Correct 14 ms 308 KB Output is correct
21 Correct 484 ms 204 KB Output is correct
22 Correct 1967 ms 296 KB Output is correct
23 Correct 381 ms 324 KB Output is correct
24 Execution timed out 2087 ms 204 KB Time limit exceeded
25 Halted 0 ms 0 KB -