답안 #99720 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
99720	2019-03-06T08:39:19 Z	kjp4155	Coin Collecting (JOI19_ho_t4)	C++17	100 / 100	116 ms	1404 KB

joi2019_ho_t4

#include <bits/stdc++.h>

using namespace std;

#define VA_NUM_ARGS(...) VA_NUM_ARGS_IMPL_((0,__VA_ARGS__, 6,5,4,3,2,1))
#define VA_NUM_ARGS_IMPL_(tuple) VA_NUM_ARGS_IMPL tuple
#define VA_NUM_ARGS_IMPL(_0,_1,_2,_3,_4,_5,_6,N,...) N
#define macro_dispatcher(macro, ...) macro_dispatcher_(macro, VA_NUM_ARGS(__VA_ARGS__))
#define macro_dispatcher_(macro, nargs) macro_dispatcher__(macro, nargs)
#define macro_dispatcher__(macro, nargs) macro_dispatcher___(macro, nargs)
#define macro_dispatcher___(macro, nargs) macro ## nargs
#define Debug1(a)           cout<<#a<<"="<<(a)<<"\n"
#define Debug2(a,b)         cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<"\n"
#define Debug3(a,b,c)       cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<"\n"
#define Debug4(a,b,c,d)     cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<"\n"
#define Debug5(a,b,c,d,e)   cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<", "<<#e<<"="<<(e)<<"\n"
#define Debug6(a,b,c,d,e,f) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<", "<<#e<<"="<<(e)<<", "<<#f<<"="<<(f)<<"\n"
#define Debug(...) macro_dispatcher(Debug, __VA_ARGS__)(__VA_ARGS__)
#define DA(a,s,n) cout<<#a<<"=["; printarray(a,s,n); cout<<"]\n"

#define TT1 template<class T>
#define TT1T2 template<class T1, class T2>
#define TT1T2T3 template<class T1, class T2, class T3>
template<class T, size_t N> ostream& operator << (ostream& os, const array<T, N>& v);
TT1T2 ostream& operator << (ostream& os, const pair<T1, T2>& p){ return os <<"("<<p.first<<", "<< p.second<<")"; }
TT1 ostream& operator << (ostream& os, const vector<T>& v){       bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
template<class T, size_t N> ostream& operator << (ostream& os, const array<T, N>& v) {     bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const set<T1, T2>&v){    bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const multiset<T1,T2>&v){bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2T3 ostream& operator << (ostream& os, const map<T1,T2,T3>& v){ bool f = 1; os << "["; for (auto& ii : v) { if (!f)os << ", "; os << "(" << ii.first << " -> " << ii.second << ") "; f = 0; }return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const multimap<T1, T2>& v){ bool f = 1; os << "["; for (auto& ii : v) { if (!f)os << ", "; os << "(" << ii.first << " -> " << ii.second << ") "; f = 0; }return os << "]"; }
TT1T2 ostream& operator << (ostream& os, priority_queue<T1, T2> v) { bool f = 1; os << "["; while (!v.empty()) { auto x = v.top(); v.pop(); if (!f) os << ", "; f = 0; os << x; } return os << "]"; }
TT1T2 void printarray(const T1& a, T2 l, T2 r){ for (T2 i = l; i<=r; i++) cout << a[i] << (i<r?" ":""); }

void cio(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    //cout << setprecision(15);
}

#define tt() printf("%.4f sec\n", (double) clock() / CLOCKS_PER_SEC )

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define Fi first
#define Se second
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define rep(i, n) for(int i=0;i<n;i++)
#define repp(i, n) for(int i=1;i<=n;i++)
#define all(x) x.begin(), x.end()
#define geti1(X) cin >> X
#define geti2(X,Y) cin >> X >> Y
#define geti3(X,Y,Z) cin >> X >> Y >> Z
#define geti4(X,Y,Z,W) cin >> X >> Y >> Z >> W
#define GET_MACRO(_1,_2,_3,_4,NAME,...) NAME
#define geti(...) GET_MACRO(__VA_ARGS__, geti4, geti3, geti2, geti1) (__VA_ARGS__)

#define endl '\n'

typedef tuple<int,int,int> t3;
typedef tuple<int,int,int,int> t4;
void die(){printf("-1\n"); exit(0);}
int xx[8] = {1,-1,0,0,1,1,-1,-1}, yy[8] = {0,0,1,-1,1,-1,1,-1};
const ll mod = 1e9+7;

#define MAXN 200020
int N;
ll margin = 0;
int p[MAXN][2];
int main(){
    scanf("%d",&N);
    repp(i,2*N){
        ll x,y; scanf("%lld%lld",&x,&y);
        y--;
        if( x < 1 ){
            if( y < 0 ){
                margin += abs(y) + (-x+1);
                p[1][0]++;
            }
            else if( y > 1 ){
                margin += y-1 + (-x+1);
                p[1][1]++;
            }
            else{
                margin += (-x+1);
                p[1][y]++;
            }
            
        }
        else if( x > N ){
            if( y < 0 ){
                margin += abs(y) + x-N;
                p[N][0]++;
            }
            else if( y > 1 ){
                margin += y-1 + x-N;
                p[N][1]++;
            }
            else{
                margin += x-N;
                p[N][y]++;
            }
        }
        else{
            if( y < 0 ){
                margin += abs(y);
                p[x][0]++;
            }
            else if( y > 1 ){
                margin += y-1;
                p[x][1]++;
            }
            else{
                p[x][y]++;
            }
        }
        
    }
    ll ans = 0;
    ll C[2] = {0,0};
    

    for(int i=1;i<=N;i++){
        C[0]--; C[1]--;
        C[0] += p[i][0];
        C[1] += p[i][1];
        
        if( C[0] > 0 && C[1] < 0 ){
            ll mn = min(abs(C[0]), abs(C[1]));
            ans += mn;
            C[0] -= mn; C[1] += mn;
        }
        else if( C[0] < 0 && C[1] > 0 ){
            ll mn = min(abs(C[0]), abs(C[1]));
            ans += mn;
            C[0] += mn; C[1] -= mn;
        }
        ans += abs(C[0]); ans += abs(C[1]);
    }
    printf("%lld\n",ans + margin);
}

Compilation message

joi2019_ho_t4.cpp: In function 'int main()':
joi2019_ho_t4.cpp:75:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&N);
     ~~~~~^~~~~~~~~
joi2019_ho_t4.cpp:77:22: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         ll x,y; scanf("%lld%lld",&x,&y);
                 ~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	3 ms	384 KB	Output is correct
7	Correct	3 ms	384 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	2 ms	384 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	2 ms	256 KB	Output is correct
13	Correct	2 ms	256 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	256 KB	Output is correct
17	Correct	3 ms	384 KB	Output is correct
18	Correct	2 ms	384 KB	Output is correct
19	Correct	2 ms	256 KB	Output is correct
20	Correct	2 ms	256 KB	Output is correct
21	Correct	3 ms	256 KB	Output is correct
22	Correct	3 ms	256 KB	Output is correct
23	Correct	2 ms	256 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	256 KB	Output is correct
27	Correct	2 ms	384 KB	Output is correct
28	Correct	3 ms	384 KB	Output is correct
29	Correct	2 ms	256 KB	Output is correct
30	Correct	3 ms	384 KB	Output is correct
31	Correct	2 ms	256 KB	Output is correct
32	Correct	3 ms	384 KB	Output is correct
33	Correct	2 ms	256 KB	Output is correct

Subtask #2
29.0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	3 ms	384 KB	Output is correct
7	Correct	3 ms	384 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	2 ms	384 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	2 ms	256 KB	Output is correct
13	Correct	2 ms	256 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	256 KB	Output is correct
17	Correct	3 ms	384 KB	Output is correct
18	Correct	2 ms	384 KB	Output is correct
19	Correct	2 ms	256 KB	Output is correct
20	Correct	2 ms	256 KB	Output is correct
21	Correct	3 ms	256 KB	Output is correct
22	Correct	3 ms	256 KB	Output is correct
23	Correct	2 ms	256 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	256 KB	Output is correct
27	Correct	2 ms	384 KB	Output is correct
28	Correct	3 ms	384 KB	Output is correct
29	Correct	2 ms	256 KB	Output is correct
30	Correct	3 ms	384 KB	Output is correct
31	Correct	2 ms	256 KB	Output is correct
32	Correct	3 ms	384 KB	Output is correct
33	Correct	2 ms	256 KB	Output is correct
34	Correct	3 ms	256 KB	Output is correct
35	Correct	3 ms	356 KB	Output is correct
36	Correct	3 ms	256 KB	Output is correct
37	Correct	3 ms	384 KB	Output is correct
38	Correct	3 ms	384 KB	Output is correct
39	Correct	3 ms	256 KB	Output is correct
40	Correct	3 ms	256 KB	Output is correct
41	Correct	3 ms	256 KB	Output is correct
42	Correct	3 ms	384 KB	Output is correct
43	Correct	3 ms	384 KB	Output is correct
44	Correct	3 ms	256 KB	Output is correct
45	Correct	4 ms	256 KB	Output is correct
46	Correct	3 ms	384 KB	Output is correct
47	Correct	2 ms	256 KB	Output is correct
48	Correct	3 ms	384 KB	Output is correct
49	Correct	3 ms	256 KB	Output is correct
50	Correct	3 ms	384 KB	Output is correct
51	Correct	3 ms	384 KB	Output is correct
52	Correct	4 ms	256 KB	Output is correct
53	Correct	3 ms	384 KB	Output is correct
54	Correct	3 ms	384 KB	Output is correct
55	Correct	3 ms	384 KB	Output is correct
56	Correct	2 ms	256 KB	Output is correct
57	Correct	3 ms	384 KB	Output is correct
58	Correct	3 ms	256 KB	Output is correct
59	Correct	3 ms	256 KB	Output is correct
60	Correct	3 ms	384 KB	Output is correct
61	Correct	2 ms	256 KB	Output is correct
62	Correct	4 ms	384 KB	Output is correct
63	Correct	3 ms	384 KB	Output is correct
64	Correct	3 ms	256 KB	Output is correct

Subtask #3
63.0 / 63.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	2 ms	384 KB	Output is correct
6	Correct	3 ms	384 KB	Output is correct
7	Correct	3 ms	384 KB	Output is correct
8	Correct	2 ms	384 KB	Output is correct
9	Correct	2 ms	384 KB	Output is correct
10	Correct	2 ms	384 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	2 ms	256 KB	Output is correct
13	Correct	2 ms	256 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	256 KB	Output is correct
17	Correct	3 ms	384 KB	Output is correct
18	Correct	2 ms	384 KB	Output is correct
19	Correct	2 ms	256 KB	Output is correct
20	Correct	2 ms	256 KB	Output is correct
21	Correct	3 ms	256 KB	Output is correct
22	Correct	3 ms	256 KB	Output is correct
23	Correct	2 ms	256 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	256 KB	Output is correct
27	Correct	2 ms	384 KB	Output is correct
28	Correct	3 ms	384 KB	Output is correct
29	Correct	2 ms	256 KB	Output is correct
30	Correct	3 ms	384 KB	Output is correct
31	Correct	2 ms	256 KB	Output is correct
32	Correct	3 ms	384 KB	Output is correct
33	Correct	2 ms	256 KB	Output is correct
34	Correct	3 ms	256 KB	Output is correct
35	Correct	3 ms	356 KB	Output is correct
36	Correct	3 ms	256 KB	Output is correct
37	Correct	3 ms	384 KB	Output is correct
38	Correct	3 ms	384 KB	Output is correct
39	Correct	3 ms	256 KB	Output is correct
40	Correct	3 ms	256 KB	Output is correct
41	Correct	3 ms	256 KB	Output is correct
42	Correct	3 ms	384 KB	Output is correct
43	Correct	3 ms	384 KB	Output is correct
44	Correct	3 ms	256 KB	Output is correct
45	Correct	4 ms	256 KB	Output is correct
46	Correct	3 ms	384 KB	Output is correct
47	Correct	2 ms	256 KB	Output is correct
48	Correct	3 ms	384 KB	Output is correct
49	Correct	3 ms	256 KB	Output is correct
50	Correct	3 ms	384 KB	Output is correct
51	Correct	3 ms	384 KB	Output is correct
52	Correct	4 ms	256 KB	Output is correct
53	Correct	3 ms	384 KB	Output is correct
54	Correct	3 ms	384 KB	Output is correct
55	Correct	3 ms	384 KB	Output is correct
56	Correct	2 ms	256 KB	Output is correct
57	Correct	3 ms	384 KB	Output is correct
58	Correct	3 ms	256 KB	Output is correct
59	Correct	3 ms	256 KB	Output is correct
60	Correct	3 ms	384 KB	Output is correct
61	Correct	2 ms	256 KB	Output is correct
62	Correct	4 ms	384 KB	Output is correct
63	Correct	3 ms	384 KB	Output is correct
64	Correct	3 ms	256 KB	Output is correct
65	Correct	57 ms	1280 KB	Output is correct
66	Correct	53 ms	512 KB	Output is correct
67	Correct	77 ms	1272 KB	Output is correct
68	Correct	90 ms	1280 KB	Output is correct
69	Correct	77 ms	1280 KB	Output is correct
70	Correct	80 ms	1280 KB	Output is correct
71	Correct	70 ms	1272 KB	Output is correct
72	Correct	59 ms	384 KB	Output is correct
73	Correct	54 ms	384 KB	Output is correct
74	Correct	52 ms	384 KB	Output is correct
75	Correct	53 ms	384 KB	Output is correct
76	Correct	62 ms	496 KB	Output is correct
77	Correct	81 ms	384 KB	Output is correct
78	Correct	56 ms	500 KB	Output is correct
79	Correct	58 ms	512 KB	Output is correct
80	Correct	55 ms	504 KB	Output is correct
81	Correct	58 ms	512 KB	Output is correct
82	Correct	72 ms	512 KB	Output is correct
83	Correct	55 ms	512 KB	Output is correct
84	Correct	52 ms	768 KB	Output is correct
85	Correct	53 ms	768 KB	Output is correct
86	Correct	59 ms	1280 KB	Output is correct
87	Correct	60 ms	1400 KB	Output is correct
88	Correct	70 ms	1400 KB	Output is correct
89	Correct	55 ms	1272 KB	Output is correct
90	Correct	116 ms	1272 KB	Output is correct
91	Correct	72 ms	1280 KB	Output is correct
92	Correct	81 ms	1272 KB	Output is correct
93	Correct	76 ms	1404 KB	Output is correct
94	Correct	78 ms	1280 KB	Output is correct
95	Correct	102 ms	1280 KB	Output is correct
96	Correct	66 ms	1052 KB	Output is correct
97	Correct	69 ms	1000 KB	Output is correct
98	Correct	78 ms	948 KB	Output is correct
99	Correct	84 ms	768 KB	Output is correct
100	Correct	65 ms	896 KB	Output is correct
101	Correct	66 ms	988 KB	Output is correct
102	Correct	60 ms	768 KB	Output is correct
103	Correct	70 ms	768 KB	Output is correct

답안 #99720

Compilation message

Subtask #1 8.0 / 8.0

Subtask #2 29.0 / 29.0

Subtask #3 63.0 / 63.0

Subtask #1
8.0 / 8.0

Subtask #2
29.0 / 29.0

Subtask #3
63.0 / 63.0