Submission #106105

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
106105	2019-04-16 14:36:21	jangwonyoung	Coin Collecting (JOI19_ho_t4)	C++14	100 / 100	121 ms	5756 KiB

joi2019_ho_t4

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<iostream>
using namespace std;
typedef long long ll;
const int N=1e5+2;
int n;
ll ans=0;
int fu[N],fd[N];
int plu,pld;
int main(){
  ios::sync_with_stdio(false);
  cin >> n;
  for(int i=1; i<=2*n ;i++){
    ll x,y;cin >> x >> y;
    ans+=max(0LL,1-x)+max(0LL,x-n);
    ans+=max(0LL,1-y)+max(0LL,y-2);
    x=min((ll)n,max(1LL,x));
    y=min(2LL,max(1LL,y));
    if(y==1) fd[x]++;
    else fu[x]++;
  }
  plu=pld=1;
  for(int pr=1; pr<=n ;pr++){
    while(plu<=pr && fu[pr]>0) ans+=pr-plu++,fu[pr]--;
    while(pld<=pr && fd[pr]>0) ans+=pr-pld++,fd[pr]--;
    while(plu>pr && pld<=pr && fu[pr]>0) ans+=pr+1-pld++,fu[pr]--;
    while(pld>pr && plu<=pr && fd[pr]>0) ans+=pr+1-plu++,fd[pr]--;
    ans+=fu[pr];fu[pr+1]+=fu[pr];fu[pr]=0;
    ans+=fd[pr];fd[pr+1]+=fd[pr];fd[pr]=0;
  }
  cout << ans << endl;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 8 / 8
• Subtask 2: 29 / 29
• Subtask 3: 63 / 63