# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1140154 | MuhammadSaram | Flooding Wall (BOI24_wall) | C++20 | 1 ms | 328 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9 + 7;
signed main()
{
int n;
cin>>n;
map<int,vector<int>> ind;
int a[n],b[n];
for (int i=0;i<n;i++)
cin>>a[i];
for (int i=0;i<n;i++)
cin>>b[i];
int mx=0,ans=0;
vector<int> ve;
for (int i=0;i<n;i++)
{
ind[a[i]].push_back(i);
ind[b[i]].push_back(i);
if (a[i]>b[i])
swap(a[i],b[i]);
mx=max(mx,a[i]);
ve.push_back(b[i]);
}
sort(ve.begin(),ve.end());
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |