제출 #381732

#제출 시각아이디문제언어결과실행 시간메모리
381732mohamedsobhi777운세 보기 2 (JOI14_fortune_telling2)C++14
4 / 100
3072 ms620 KiB
#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; }

컴파일 시 표준 에러 (stderr) 메시지

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;
      |                   ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...