| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1066895 | MunkhErdene | A Plus B (IOI23_aplusb) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ll long long
using namespace std;
#define no cout<<"NO"<<endl
#define yes cout<<"YES"<<endl
const ll mod=998244353;
int *smallest_sums(int n, int arr1[100'000], int arr2[100'000]){
sort(arr1, arr1+n);
sort(arr2, arr2+n);
int g=0;
int h=0;
int* result = new int[100'000];
for(int i=0 ; i<n ; i++){
result[i]=arr1[g]+arr2[h];
if(arr1[g+1]+arr2[h]>arr1[g]+arr2[h+1]){
h++;
}
else{
g++;
}
}
return result;
}
/*void solve(){
ll a, b, c, d, e, g, h, x, y, z, t, m, n, o, p, i, j, k,q,l,r;
ll s = 0, niilber = 0, urjver = 1, opinion, element;
ll aravt, zuut, negj, negjOld;
string ug, ug1, ug2;
float bt;
char useg = 'a';
bool bval = true, bval1 = false;
cin>>n;
ll arr[n];
map<int,vector<int>> mp;
for(int i=0;i<n;i++){
cin>>arr[i];
mp[arr[i]].push_back(i);
}
vector<vector<int>> vec;
for(auto x:mp){
vec.push_back(x.second);
}
sort(vec.begin(),vec.end());
cin>>m;
for(int i=0;i<m;i++){
string ug;
cin>>ug;
if(ug.length()!=n){
no;
continue;
}
else{
map<char,vector<int>> temp;
for(int j=0;j<ug.length();j++){
temp[ug[j]].push_back(j);
}
vector<vector<int>> vec1;
for(auto x:temp){
vec1.push_back(x.second);
}
sort(vec1.begin(),vec1.end());
if(vec==vec1){
yes;
}
else{
no;
}
}
}
}
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
ll testCase=1;
cin >> testCase;
while (testCase--) {
solve();
}
}*/