oj.uz

Submission #547388

# Submission time Handle Problem Language Result Execution time Memory
547388 2022-04-10T15:10:12 Z duality Sightseeing in Kyoto (JOI22_kyoto) C++17
100 / 100
 33 ms 1600 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 A[100000],B[100000];
LLI dp[1001][1001];
int ccw(pii a,pii b,pii c) {
    return (LLI) (b.first-a.first)*(c.second-a.second) >= (LLI) (b.second-a.second)*(c.first-a.first);
}
LLI solve(vi a,vi b) {
    int i = 0,j = 0;
    LLI ans = 0;
    while ((i < a.size()-1) || (j < b.size()-1)) {
        int f;
        if (i == a.size()-1) f = 1;
        else if (j == b.size()-1) f = 0;
        else {
            if ((LLI) abs(A[a[i+1]]-A[a[i]])*abs(b[j+1]-b[j]) < (LLI) abs(B[b[j+1]]-B[b[j]])*abs(a[i+1]-a[i])) f = 0;
            else f = 1;
        }
        if (f) ans += (LLI) A[a[i]]*abs(b[j+1]-b[j]),j++;
        else ans += (LLI) B[b[j]]*abs(a[i+1]-a[i]),i++;
    }
    return ans;
}
int main() {
    int i;
    int H,W;
    scanf("%d %d",&H,&W);
    for (i = 0; i < H; i++) scanf("%d",&A[i]);
    for (i = 0; i < W; i++) scanf("%d",&B[i]);

    LLI ans = 0;
    int x = min_element(A,A+H)-A,y = min_element(B,B+W)-B;
    vi a,b;
    for (i = x; i < H; i++) {
        while (!a.empty() && (a.back() != x) && ccw(mp(a[a.size()-2],A[a[a.size()-2]]),mp(i,A[i]),mp(a.back(),A[a.back()]))) a.pop_back();
        a.pb(i);
    }
    for (i = y; i < W; i++) {
        while (!b.empty() && (b.back() != y) && ccw(mp(b[b.size()-2],B[b[b.size()-2]]),mp(i,B[i]),mp(b.back(),B[b.back()]))) b.pop_back();
        b.pb(i);
    }
    ans += solve(a,b);
    a.clear(),b.clear();
    for (i = x; i >= 0; i--) {
        while (!a.empty() && (a.back() != x) && ccw(mp(a[a.size()-2],A[a[a.size()-2]]),mp(a.back(),A[a.back()]),mp(i,A[i]))) a.pop_back();
        a.pb(i);
    }
    for (i = y; i >= 0; i--) {
        while (!b.empty() && (b.back() != y) && ccw(mp(b[b.size()-2],B[b[b.size()-2]]),mp(b.back(),B[b.back()]),mp(i,B[i]))) b.pop_back();
        b.pb(i);
    }
    ans += solve(a,b);
    printf("%lld\n",ans);

    return 0;
}

Compilation message

kyoto.cpp: In function 'LLI solve(vi, vi)':
kyoto.cpp:66:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |     while ((i < a.size()-1) || (j < b.size()-1)) {
      |             ~~^~~~~~~~~~~~
kyoto.cpp:66:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |     while ((i < a.size()-1) || (j < b.size()-1)) {
      |                                 ~~^~~~~~~~~~~~
kyoto.cpp:68:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |         if (i == a.size()-1) f = 1;
      |             ~~^~~~~~~~~~~~~
kyoto.cpp:69:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |         else if (j == b.size()-1) f = 0;
      |                  ~~^~~~~~~~~~~~~
kyoto.cpp: In function 'int main()':
kyoto.cpp:82:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   82 |     scanf("%d %d",&H,&W);
      |     ~~~~~^~~~~~~~~~~~~~~
kyoto.cpp:83:34: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   83 |     for (i = 0; i < H; i++) scanf("%d",&A[i]);
      |                             ~~~~~^~~~~~~~~~~~
kyoto.cpp:84:34: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   84 |     for (i = 0; i < W; i++) scanf("%d",&B[i]);
      |                             ~~~~~^~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 316 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 8 ms 596 KB Output is correct
5 Correct 6 ms 600 KB Output is correct
6 Correct 4 ms 340 KB Output is correct
7 Correct 18 ms 980 KB Output is correct
8 Correct 25 ms 1024 KB Output is correct
9 Correct 22 ms 1092 KB Output is correct
10 Correct 28 ms 972 KB Output is correct
11 Correct 21 ms 1048 KB Output is correct
12 Correct 17 ms 1088 KB Output is correct
13 Correct 18 ms 980 KB Output is correct
14 Correct 16 ms 1068 KB Output is correct
15 Correct 17 ms 1088 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 316 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 8 ms 596 KB Output is correct
33 Correct 6 ms 600 KB Output is correct
34 Correct 4 ms 340 KB Output is correct
35 Correct 18 ms 980 KB Output is correct
36 Correct 25 ms 1024 KB Output is correct
37 Correct 22 ms 1092 KB Output is correct
38 Correct 28 ms 972 KB Output is correct
39 Correct 21 ms 1048 KB Output is correct
40 Correct 17 ms 1088 KB Output is correct
41 Correct 18 ms 980 KB Output is correct
42 Correct 16 ms 1068 KB Output is correct
43 Correct 17 ms 1088 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 0 ms 212 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 0 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 0 ms 212 KB Output is correct
54 Correct 0 ms 212 KB Output is correct
55 Correct 12 ms 648 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 4 ms 340 KB Output is correct
59 Correct 25 ms 980 KB Output is correct
60 Correct 25 ms 1008 KB Output is correct
61 Correct 28 ms 1076 KB Output is correct
62 Correct 26 ms 1064 KB Output is correct
63 Correct 22 ms 1600 KB Output is correct
64 Correct 23 ms 972 KB Output is correct
65 Correct 24 ms 980 KB Output is correct
66 Correct 24 ms 972 KB Output is correct
67 Correct 33 ms 988 KB Output is correct