# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
487127 |
2021-11-14T13:51:54 Z |
JovanB |
Ljeto (COCI21_ljeto) |
C++17 |
|
1 ms |
460 KB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int a[105];
int b[105];
void solve(){
int n;
cin >> n;
for(int i=1; i<=n; i++) cin >> a[i];
for(int i=1; i<=n; i++) cin >> b[i];
sort(a+1, a+1+n);
sort(b+1, b+1+n);
bool g = 1;
for(int i=1; i<=n; i++) g &= (a[i] == b[i] || a[i] + 1 == b[i]);
if(g) cout << "YES\n";
else cout << "NO\n";
}
int main(){
ios_base::sync_with_stdio(false), cin.tie(0);
cout.precision(10);
cout << fixed;
int t;
cin >> t;
while(t--) solve();
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
460 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
460 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
460 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |