답안 #466166

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
466166 2021-08-18T09:00:53 Z jamezzz Coin Collecting (JOI19_ho_t4) C++17
100 / 100
83 ms 5688 KB
#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
#define dbg(...) printf(__VA_ARGS__);
#else
#define dbg(...)
#endif
#define sf scanf
#define pf printf
#define fi first
#define se second
#define pb emplace_back
#define sz(x) (int)x.size()
#define mnto(x,y) x=min(x,(__typeof__(x))y)
#define mxto(x,y) x=max(x,(__typeof__(x))y)
#define INF 1023456789
#define LINF 1023456789123456789
#define all(x) x.begin(), x.end()
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<pll> vll;
mt19937 rng(time(0));

int n,x,y,c[100005][2];
ll ans;

int main(){
	sf("%d",&n);
	memset(c,-1,sizeof c);
	for(int i=0;i<2*n;++i){
		sf("%d%d",&x,&y);
		if(x<1)ans+=1-x,x=1;
		if(x>n)ans+=x-n,x=n;
		if(y<1)ans+=1-y,y=1;
		if(y>2)ans+=y-2,y=2;
		++c[x-1][y-1];
	}
	for(int i=0;i<n;++i){
		int x=min(abs(c[i][0]),abs(c[i][1]));
		if(c[i][0]<0&&c[i][1]>0)c[i][0]+=x,c[i][1]-=x,ans+=x;
		if(c[i][0]>0&&c[i][1]<0)c[i][0]-=x,c[i][1]+=x,ans+=x;
		ans+=abs(c[i][0])+abs(c[i][1]);
		c[i+1][0]+=c[i][0],c[i+1][1]+=c[i][1];
	}
	pf("%lld\n",ans);
}

Compilation message

joi2019_ho_t4.cpp: In function 'int main()':
joi2019_ho_t4.cpp:35:4: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |  sf("%d",&n);
      |    ^
joi2019_ho_t4.cpp:38:5: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |   sf("%d%d",&x,&y);
      |     ^
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 1 ms 972 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 972 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 972 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 1 ms 972 KB Output is correct
10 Correct 1 ms 1072 KB Output is correct
11 Correct 1 ms 972 KB Output is correct
12 Correct 1 ms 972 KB Output is correct
13 Correct 1 ms 972 KB Output is correct
14 Correct 1 ms 972 KB Output is correct
15 Correct 1 ms 972 KB Output is correct
16 Correct 1 ms 972 KB Output is correct
17 Correct 1 ms 972 KB Output is correct
18 Correct 1 ms 1072 KB Output is correct
19 Correct 1 ms 972 KB Output is correct
20 Correct 1 ms 972 KB Output is correct
21 Correct 1 ms 972 KB Output is correct
22 Correct 1 ms 972 KB Output is correct
23 Correct 1 ms 972 KB Output is correct
24 Correct 1 ms 972 KB Output is correct
25 Correct 1 ms 984 KB Output is correct
26 Correct 1 ms 972 KB Output is correct
27 Correct 1 ms 972 KB Output is correct
28 Correct 1 ms 972 KB Output is correct
29 Correct 1 ms 972 KB Output is correct
30 Correct 1 ms 1072 KB Output is correct
31 Correct 1 ms 972 KB Output is correct
32 Correct 1 ms 972 KB Output is correct
33 Correct 1 ms 972 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 1 ms 972 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 972 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 972 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 1 ms 972 KB Output is correct
10 Correct 1 ms 1072 KB Output is correct
11 Correct 1 ms 972 KB Output is correct
12 Correct 1 ms 972 KB Output is correct
13 Correct 1 ms 972 KB Output is correct
14 Correct 1 ms 972 KB Output is correct
15 Correct 1 ms 972 KB Output is correct
16 Correct 1 ms 972 KB Output is correct
17 Correct 1 ms 972 KB Output is correct
18 Correct 1 ms 1072 KB Output is correct
19 Correct 1 ms 972 KB Output is correct
20 Correct 1 ms 972 KB Output is correct
21 Correct 1 ms 972 KB Output is correct
22 Correct 1 ms 972 KB Output is correct
23 Correct 1 ms 972 KB Output is correct
24 Correct 1 ms 972 KB Output is correct
25 Correct 1 ms 984 KB Output is correct
26 Correct 1 ms 972 KB Output is correct
27 Correct 1 ms 972 KB Output is correct
28 Correct 1 ms 972 KB Output is correct
29 Correct 1 ms 972 KB Output is correct
30 Correct 1 ms 1072 KB Output is correct
31 Correct 1 ms 972 KB Output is correct
32 Correct 1 ms 972 KB Output is correct
33 Correct 1 ms 972 KB Output is correct
34 Correct 1 ms 972 KB Output is correct
35 Correct 1 ms 1100 KB Output is correct
36 Correct 1 ms 1100 KB Output is correct
37 Correct 1 ms 1100 KB Output is correct
38 Correct 1 ms 1100 KB Output is correct
39 Correct 1 ms 1084 KB Output is correct
40 Correct 1 ms 1100 KB Output is correct
41 Correct 1 ms 1100 KB Output is correct
42 Correct 1 ms 1100 KB Output is correct
43 Correct 1 ms 1100 KB Output is correct
44 Correct 1 ms 1084 KB Output is correct
45 Correct 1 ms 1100 KB Output is correct
46 Correct 1 ms 1100 KB Output is correct
47 Correct 1 ms 1100 KB Output is correct
48 Correct 1 ms 1100 KB Output is correct
49 Correct 1 ms 1100 KB Output is correct
50 Correct 1 ms 1100 KB Output is correct
51 Correct 1 ms 1100 KB Output is correct
52 Correct 1 ms 1100 KB Output is correct
53 Correct 1 ms 1100 KB Output is correct
54 Correct 1 ms 1100 KB Output is correct
55 Correct 1 ms 1100 KB Output is correct
56 Correct 1 ms 1100 KB Output is correct
57 Correct 1 ms 1100 KB Output is correct
58 Correct 1 ms 1100 KB Output is correct
59 Correct 1 ms 1100 KB Output is correct
60 Correct 1 ms 1100 KB Output is correct
61 Correct 1 ms 1100 KB Output is correct
62 Correct 1 ms 1100 KB Output is correct
63 Correct 1 ms 1100 KB Output is correct
64 Correct 2 ms 1100 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 1 ms 972 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 972 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 972 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 1 ms 972 KB Output is correct
10 Correct 1 ms 1072 KB Output is correct
11 Correct 1 ms 972 KB Output is correct
12 Correct 1 ms 972 KB Output is correct
13 Correct 1 ms 972 KB Output is correct
14 Correct 1 ms 972 KB Output is correct
15 Correct 1 ms 972 KB Output is correct
16 Correct 1 ms 972 KB Output is correct
17 Correct 1 ms 972 KB Output is correct
18 Correct 1 ms 1072 KB Output is correct
19 Correct 1 ms 972 KB Output is correct
20 Correct 1 ms 972 KB Output is correct
21 Correct 1 ms 972 KB Output is correct
22 Correct 1 ms 972 KB Output is correct
23 Correct 1 ms 972 KB Output is correct
24 Correct 1 ms 972 KB Output is correct
25 Correct 1 ms 984 KB Output is correct
26 Correct 1 ms 972 KB Output is correct
27 Correct 1 ms 972 KB Output is correct
28 Correct 1 ms 972 KB Output is correct
29 Correct 1 ms 972 KB Output is correct
30 Correct 1 ms 1072 KB Output is correct
31 Correct 1 ms 972 KB Output is correct
32 Correct 1 ms 972 KB Output is correct
33 Correct 1 ms 972 KB Output is correct
34 Correct 1 ms 972 KB Output is correct
35 Correct 1 ms 1100 KB Output is correct
36 Correct 1 ms 1100 KB Output is correct
37 Correct 1 ms 1100 KB Output is correct
38 Correct 1 ms 1100 KB Output is correct
39 Correct 1 ms 1084 KB Output is correct
40 Correct 1 ms 1100 KB Output is correct
41 Correct 1 ms 1100 KB Output is correct
42 Correct 1 ms 1100 KB Output is correct
43 Correct 1 ms 1100 KB Output is correct
44 Correct 1 ms 1084 KB Output is correct
45 Correct 1 ms 1100 KB Output is correct
46 Correct 1 ms 1100 KB Output is correct
47 Correct 1 ms 1100 KB Output is correct
48 Correct 1 ms 1100 KB Output is correct
49 Correct 1 ms 1100 KB Output is correct
50 Correct 1 ms 1100 KB Output is correct
51 Correct 1 ms 1100 KB Output is correct
52 Correct 1 ms 1100 KB Output is correct
53 Correct 1 ms 1100 KB Output is correct
54 Correct 1 ms 1100 KB Output is correct
55 Correct 1 ms 1100 KB Output is correct
56 Correct 1 ms 1100 KB Output is correct
57 Correct 1 ms 1100 KB Output is correct
58 Correct 1 ms 1100 KB Output is correct
59 Correct 1 ms 1100 KB Output is correct
60 Correct 1 ms 1100 KB Output is correct
61 Correct 1 ms 1100 KB Output is correct
62 Correct 1 ms 1100 KB Output is correct
63 Correct 1 ms 1100 KB Output is correct
64 Correct 2 ms 1100 KB Output is correct
65 Correct 41 ms 2500 KB Output is correct
66 Correct 61 ms 5688 KB Output is correct
67 Correct 57 ms 4124 KB Output is correct
68 Correct 53 ms 4124 KB Output is correct
69 Correct 67 ms 4128 KB Output is correct
70 Correct 51 ms 4240 KB Output is correct
71 Correct 53 ms 4124 KB Output is correct
72 Correct 51 ms 4256 KB Output is correct
73 Correct 51 ms 4292 KB Output is correct
74 Correct 52 ms 4248 KB Output is correct
75 Correct 55 ms 4124 KB Output is correct
76 Correct 66 ms 4252 KB Output is correct
77 Correct 75 ms 4124 KB Output is correct
78 Correct 55 ms 4256 KB Output is correct
79 Correct 50 ms 4244 KB Output is correct
80 Correct 49 ms 4252 KB Output is correct
81 Correct 49 ms 4260 KB Output is correct
82 Correct 49 ms 4128 KB Output is correct
83 Correct 53 ms 4260 KB Output is correct
84 Correct 53 ms 4124 KB Output is correct
85 Correct 51 ms 4124 KB Output is correct
86 Correct 83 ms 4292 KB Output is correct
87 Correct 51 ms 4244 KB Output is correct
88 Correct 52 ms 4244 KB Output is correct
89 Correct 52 ms 4128 KB Output is correct
90 Correct 70 ms 4124 KB Output is correct
91 Correct 52 ms 4128 KB Output is correct
92 Correct 51 ms 4244 KB Output is correct
93 Correct 52 ms 4256 KB Output is correct
94 Correct 52 ms 4128 KB Output is correct
95 Correct 54 ms 4132 KB Output is correct
96 Correct 54 ms 4248 KB Output is correct
97 Correct 51 ms 4292 KB Output is correct
98 Correct 58 ms 4284 KB Output is correct
99 Correct 50 ms 4244 KB Output is correct
100 Correct 55 ms 4244 KB Output is correct
101 Correct 53 ms 4128 KB Output is correct
102 Correct 57 ms 4260 KB Output is correct
103 Correct 59 ms 4240 KB Output is correct