| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 381732 | mohamedsobhi777 | Fortune Telling 2 (JOI14_fortune_telling2) | C++14 | 3072 ms | 620 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>
using namespace std;
#define vi vector<int>
#define vll vector<ll>
#define vii vector<pair<int, int>>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define loop(_) for (int __ = 0; __ < (_); ++__)
#define pb push_back
#define f first
#define s second
#define sz(_) ((int)_.size())
#define all(_) _.begin(), _.end()
#define lb lower_bound
#define ub upper_bound
using ll = long long;
using ld = long double;
const int N = 1e5 + 7;
const ll mod = 1e9 + 7;
int n, k;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
#endif
cin >> n >> k;
vii a(n);
for (int i = 0; i < n; ++i)
cin >> a[i].f >> a[i].s;
vi b(k);
for (auto &u : b)
cin >> u;
ll sum = 0;
for (int i = 0; i < n; ++i)
{
ll L = min(a[i].f, a[i].s);
ll R = max(a[i].f, a[i].s);
int lst = -1;
int cnt = 0;
bool flag = 0;
for (int j = 0; j < k; ++j)
{
if (b[j] >= L && b[j] < R)
{
lst = j;
cnt = 0;
flag = 1;
}
else if (b[j] >= R)
{
++cnt;
}
}
if (flag)
{
if (a[i].f < a[i].s)
swap(a[i].f, a[i].s);
}
if (cnt & 1)
swap(a[i].f, a[i].s);
sum += a[i].f;
}
cout << sum;
return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
