oj.uz

답안 #572238

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
572238 2022-06-04T03:25:35 Z AGE Simfonija (COCI19_simfonija) C++14
44 / 110
 116 ms 11208 KB 
#include<bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define int long long
using namespace std;
const int N=1e6,M=2e3;

int a[100005],b[100005],xx[N*4+10];
main()
{

    int n,m;
    cin>>n>>m;

    map<int,int>mp;

    for(int i=0;i<n;i++)
        cin>>a[i];

    for(int i=0;i<n;i++)
        cin>>b[i];

    for(int i=0;i<n;i++)
        xx[a[i]-b[i]+(int)2e6]++;

    int neg=0,pos=0;
    for(int i=0;i<=2e6;i++)
        neg+=xx[i];

    for(int i=2e6+1;i<=4e6;i++)
        pos+=xx[i];

    int ans=0,anss=1e18;

    for(int i=0;i<n;i++)
        ans+=abs(a[i]-b[i]);

    anss=min(abs(ans),anss);

    for(int j=2e6-1;j>=0;j--){

        ans-=pos;
        ans+=neg;

        anss=min(anss,abs(ans));
        int neww=(int)2e6-j;
        neww=(int)2e6+neww;

        neg+=xx[neww];
        pos-=xx[neww];

    }

    ans=0,pos=0,neg=0;

    for(int i=0;i<n;i++)
        ans+=abs(a[i]-b[i]);

    for(int i=0;i<2e6;i++)
        neg+=xx[i];

    for(int i=2e6;i<=4e6;i++)
        pos+=xx[i];

    for(int j=2e6+1;j<=4e6;j++){

        ans-=neg;
        ans+=pos;

        anss=min(anss,abs(ans));
        int neww=j-(int)2e6;
        neww=(int)2e6-neww;

        neg-=xx[neww];
        pos+=xx[neww];

    }

    cout<<anss<<endl;
    return 0;
}

Compilation message

simfonija.cpp:10:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   10 | main()
      | ^~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 328 KB Output is correct
2 Correct 17 ms 384 KB Output is correct
3 Correct 17 ms 384 KB Output is correct

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 84 ms 11124 KB Output is correct
2 Correct 92 ms 5064 KB Output is correct
3 Correct 89 ms 3324 KB Output is correct

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 82 ms 11104 KB Output is correct
2 Correct 75 ms 5072 KB Output is correct
3 Correct 90 ms 3384 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 116 ms 10996 KB Output is correct
2 Correct 76 ms 5044 KB Output is correct
3 Correct 75 ms 3368 KB Output is correct

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 57 ms 2680 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 84 ms 11208 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 78 ms 3312 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 79 ms 11128 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 78 ms 10444 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 89 ms 3596 KB Output isn't correct
2 Halted 0 ms 0 KB -