답안 #99718 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
99718	2019-03-06T08:34:56 Z	kjp4155	Coin Collecting (JOI19_ho_t4)	C++17	37 / 100	8 ms	428 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 2020
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);
        ll mn = 1e18, xx = -1, yy = -1;
        for(ll a=1;a<=N;a++) for(ll b=0;b<=1;b++){
            if( abs(x-a) + abs(y-(b+1)) < mn ) {
                mn = abs(x-a) + abs(y-(b+1));
                xx = a; yy = b;
            }
        }
        margin += mn;
        p[xx][yy]++;
    }
    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	3 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	3 ms	256 KB	Output is correct
6	Correct	2 ms	256 KB	Output is correct
7	Correct	2 ms	256 KB	Output is correct
8	Correct	3 ms	256 KB	Output is correct
9	Correct	2 ms	256 KB	Output is correct
10	Correct	3 ms	256 KB	Output is correct
11	Correct	3 ms	256 KB	Output is correct
12	Correct	2 ms	256 KB	Output is correct
13	Correct	3 ms	384 KB	Output is correct
14	Correct	2 ms	384 KB	Output is correct
15	Correct	2 ms	384 KB	Output is correct
16	Correct	2 ms	256 KB	Output is correct
17	Correct	2 ms	256 KB	Output is correct
18	Correct	2 ms	256 KB	Output is correct
19	Correct	3 ms	256 KB	Output is correct
20	Correct	3 ms	384 KB	Output is correct
21	Correct	3 ms	384 KB	Output is correct
22	Correct	3 ms	384 KB	Output is correct
23	Correct	3 ms	384 KB	Output is correct
24	Correct	2 ms	256 KB	Output is correct
25	Correct	2 ms	384 KB	Output is correct
26	Correct	2 ms	256 KB	Output is correct
27	Correct	3 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	2 ms	256 KB	Output is correct
31	Correct	3 ms	384 KB	Output is correct
32	Correct	3 ms	384 KB	Output is correct
33	Correct	3 ms	384 KB	Output is correct

Subtask #2
29.0 / 29.0

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

Subtask #3
0 / 63.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 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	3 ms	256 KB	Output is correct
6	Correct	2 ms	256 KB	Output is correct
7	Correct	2 ms	256 KB	Output is correct
8	Correct	3 ms	256 KB	Output is correct
9	Correct	2 ms	256 KB	Output is correct
10	Correct	3 ms	256 KB	Output is correct
11	Correct	3 ms	256 KB	Output is correct
12	Correct	2 ms	256 KB	Output is correct
13	Correct	3 ms	384 KB	Output is correct
14	Correct	2 ms	384 KB	Output is correct
15	Correct	2 ms	384 KB	Output is correct
16	Correct	2 ms	256 KB	Output is correct
17	Correct	2 ms	256 KB	Output is correct
18	Correct	2 ms	256 KB	Output is correct
19	Correct	3 ms	256 KB	Output is correct
20	Correct	3 ms	384 KB	Output is correct
21	Correct	3 ms	384 KB	Output is correct
22	Correct	3 ms	384 KB	Output is correct
23	Correct	3 ms	384 KB	Output is correct
24	Correct	2 ms	256 KB	Output is correct
25	Correct	2 ms	384 KB	Output is correct
26	Correct	2 ms	256 KB	Output is correct
27	Correct	3 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	2 ms	256 KB	Output is correct
31	Correct	3 ms	384 KB	Output is correct
32	Correct	3 ms	384 KB	Output is correct
33	Correct	3 ms	384 KB	Output is correct
34	Correct	5 ms	372 KB	Output is correct
35	Correct	6 ms	384 KB	Output is correct
36	Correct	7 ms	384 KB	Output is correct
37	Correct	7 ms	384 KB	Output is correct
38	Correct	6 ms	384 KB	Output is correct
39	Correct	8 ms	384 KB	Output is correct
40	Correct	6 ms	384 KB	Output is correct
41	Correct	6 ms	256 KB	Output is correct
42	Correct	6 ms	384 KB	Output is correct
43	Correct	6 ms	256 KB	Output is correct
44	Correct	6 ms	256 KB	Output is correct
45	Correct	6 ms	256 KB	Output is correct
46	Correct	6 ms	384 KB	Output is correct
47	Correct	6 ms	384 KB	Output is correct
48	Correct	8 ms	256 KB	Output is correct
49	Correct	7 ms	384 KB	Output is correct
50	Correct	7 ms	384 KB	Output is correct
51	Correct	6 ms	428 KB	Output is correct
52	Correct	7 ms	384 KB	Output is correct
53	Correct	6 ms	384 KB	Output is correct
54	Correct	6 ms	384 KB	Output is correct
55	Correct	5 ms	256 KB	Output is correct
56	Correct	6 ms	384 KB	Output is correct
57	Correct	6 ms	384 KB	Output is correct
58	Correct	7 ms	384 KB	Output is correct
59	Correct	7 ms	384 KB	Output is correct
60	Correct	8 ms	384 KB	Output is correct
61	Correct	6 ms	384 KB	Output is correct
62	Correct	6 ms	384 KB	Output is correct
63	Correct	7 ms	256 KB	Output is correct
64	Correct	7 ms	380 KB	Output is correct
65	Runtime error	3 ms	412 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
66	Halted	0 ms	0 KB	-

답안 #99718

Compilation message

Subtask #1 8.0 / 8.0

Subtask #2 29.0 / 29.0

Subtask #3 0 / 63.0

Subtask #1
8.0 / 8.0

Subtask #2
29.0 / 29.0

Subtask #3
0 / 63.0