oj.uz

Submission #1055718

# Submission time Handle Problem Language Result Execution time Memory
1055718 2024-08-13T04:27:22 Z 변재우(#11070) Pizza Party (CCO24_day1problem2) C++17
0 / 12
 94 ms 23912 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;

const int Nmax=1000010;
int N, A[Nmax], B[Nmax], cnt[Nmax];

signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin>>N;
    for(int i=1; i<=N; i++) cin>>A[i], cnt[A[i]]++;
    for(int i=1; i<=N; i++) cin>>B[i], cnt[B[i]]--;
    for(int i=1; i<=N; i++) if(cnt[i]) {
        cout<<-1; return 0;
    }
    bool flag=true;
    for(int i=1; i<=N; i++) if(A[i]!=B[N-i+1]) flag=false;
    cout<<2-flag;
    return 0;
}

Subtask #1
0.0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 54 ms 17500 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4444 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 94 ms 23912 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -