oj.uz

답안 #472304

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
472304 2021-09-13T11:23:48 Z Mr_Ph Cipele (COCI18_cipele) C++14
36 / 90
 1000 ms 2664 KB 
///made by : Mr_Ph :D
#include<bits/stdc++.h>
#include<unordered_map>
typedef long long ll;
typedef long long int lli;
typedef unsigned long long ull;
using namespace std;
const double PI=acos(-1.0);
const ll mod=(ll)1e9+7;
//int a1[4] = {0, 0, 1, -1};
//int b1[4] = {1, -1, 0, 0};
///the defines :)
#define endl '\n'
#define vi vector<int>
#define vll vector<ll>
#define lower(s) transform(s.begin(),s.end(),s.begin(),::tolower)
#define upper(s) transform(s.begin(),s.end(),s.begin(),::toupper)
#define ent(arr) for(int i=0;i<arr.size();i++)cin>>arr[i];
#define all(arr) arr.begin(),arr.end()
#define allr(arr) arr.rbegin(),arr.rend()
#define sz size()
///the end of the defines ;)
void solve()
{
    int n,m;
    cin>>n>>m;
    vll arr(n);
    vll brr(m);
    ent(arr);
    ent(brr);
    vector<ll>mp(n+1);
    sort(all(arr));
    sort(all(brr));
    ll mxdiff=0,ans=0;
    if(n==m)
    {
        for(int i=0;i<n;i++)
            mxdiff=max(abs(arr[i]-brr[i]),mxdiff);
        cout<<mxdiff<<endl;
    }
    else if(n>m)
    {
        for(int i=0; i<m; i++)
        {
            ll mndiff=INT_MAX;
            for(int k=i; k<n; k++)
                if(!mp[k])
                    mndiff=min(mndiff,abs(brr[i]-arr[k]));
            for(int k=i; k<n; k++)
            {
                if(abs(arr[k]-brr[i])==mndiff&&!mp[k])
                {
                    mp[k]++;
                    break;
                }
            }
            ans=max(ans,mndiff);
        }
            cout<<ans<<endl;

    }
    else
    {
        for(int i=0; i<n; i++)
        {
            ll mndiff=INT_MAX;
            for(int k=i; k<m; k++)
                if(!mp[k])
                    mndiff=min(mndiff,abs(arr[i]-brr[k]));
            for(int k=i; k<n; k++)
            {
                if(abs(brr[k]-arr[i])==mndiff&&!mp[k])
                {
                    mp[k]++;
                    break;
                }
            }
            ans=max(ans,mndiff);
        }
    cout<<ans<<endl;
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(0);
    //freopen("window.in","r",stdin);
    //freopen("output.txt","w",stdout);
    int t=1;//int st;
    //cin>>t;//cin>>st;
    while(t--)
        solve();
}

Compilation message

cipele.cpp: In function 'void solve()':
cipele.cpp:18:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 | #define ent(arr) for(int i=0;i<arr.size();i++)cin>>arr[i];
      |                              ~^~~~~~~~~~~
cipele.cpp:29:5: note: in expansion of macro 'ent'
   29 |     ent(arr);
      |     ^~~
cipele.cpp:18:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 | #define ent(arr) for(int i=0;i<arr.size();i++)cin>>arr[i];
      |                              ~^~~~~~~~~~~
cipele.cpp:30:5: note: in expansion of macro 'ent'
   30 |     ent(brr);
      |     ^~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 2636 KB Output is correct
2 Correct 42 ms 2660 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 2644 KB Output is correct
2 Correct 43 ms 2664 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 332 KB Output is correct
2 Correct 20 ms 428 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 20 ms 428 KB Output is correct

Subtask #5
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 588 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 588 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

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

Subtask #8
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1090 ms 1980 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1092 ms 2252 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1077 ms 2072 KB Time limit exceeded
2 Halted 0 ms 0 KB -