oj.uz

답안 #381732

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
381732 2021-03-25T19:14:57 Z mohamedsobhi777 운세 보기 2 (JOI14_fortune_telling2) C++14
4 / 100
 3000 ms 620 KB 
#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

fortune_telling2.cpp: In function 'int main()':
fortune_telling2.cpp:45:19: warning: variable 'lst' set but not used [-Wunused-but-set-variable]
   45 |               int lst = -1;
      |                   ^~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 4 ms 364 KB Output is correct
3 Correct 6 ms 364 KB Output is correct
4 Correct 6 ms 364 KB Output is correct
5 Correct 6 ms 364 KB Output is correct
6 Correct 6 ms 364 KB Output is correct
7 Correct 5 ms 364 KB Output is correct
8 Correct 3 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 4 ms 364 KB Output is correct
11 Correct 5 ms 364 KB Output is correct
12 Correct 5 ms 364 KB Output is correct
13 Correct 5 ms 364 KB Output is correct

Subtask #2
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 4 ms 364 KB Output is correct
3 Correct 6 ms 364 KB Output is correct
4 Correct 6 ms 364 KB Output is correct
5 Correct 6 ms 364 KB Output is correct
6 Correct 6 ms 364 KB Output is correct
7 Correct 5 ms 364 KB Output is correct
8 Correct 3 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 4 ms 364 KB Output is correct
11 Correct 5 ms 364 KB Output is correct
12 Correct 5 ms 364 KB Output is correct
13 Correct 5 ms 364 KB Output is correct
14 Correct 552 ms 512 KB Output is correct
15 Correct 2150 ms 620 KB Output is correct
16 Execution timed out 3072 ms 620 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #3
0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 4 ms 364 KB Output is correct
3 Correct 6 ms 364 KB Output is correct
4 Correct 6 ms 364 KB Output is correct
5 Correct 6 ms 364 KB Output is correct
6 Correct 6 ms 364 KB Output is correct
7 Correct 5 ms 364 KB Output is correct
8 Correct 3 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 4 ms 364 KB Output is correct
11 Correct 5 ms 364 KB Output is correct
12 Correct 5 ms 364 KB Output is correct
13 Correct 5 ms 364 KB Output is correct
14 Correct 552 ms 512 KB Output is correct
15 Correct 2150 ms 620 KB Output is correct
16 Execution timed out 3072 ms 620 KB Time limit exceeded
17 Halted 0 ms 0 KB -