# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
938382 | 2024-03-05T05:30:04 Z | Mohammadamin__Sh | Fortune Telling 2 (JOI14_fortune_telling2) | C++17 | 1 ms | 344 KB |
//In His Name #include <bits/stdc++.h> #pragma GCC optimize("O3,unroll-loops") #pragma GCC target("avx2") using namespace std; #define ll long long //#define int ll typedef pair<int, int> pii; #define F first #define S second #define pb push_back #define bug(x) cout << "Ah shit , here we go again : " << x <<endl #define all(x) x.begin() , x.end() const int maxn = 40000 , MOD = 1e9 + 7; const ll INF = 1e18 + 100; int n , k; pair<unsigned char , unsigned char> c[maxn]; int32_t main(){ ios_base::sync_with_stdio(false); cin.tie(0) , cout.tie(0); scanf("%d%d" , &n , &k); for(int i = 0 ; i < n ; i++) scanf("%hhu%hhu" , &c[i].F , &c[i].S); while(k--){ unsigned char t; scanf("%hhu" , &t); for(int i = 0 ; i < n ; i++) (t >= c[i].F ? swap(c[i].F , c[i].S) : swap(c[i].F , c[i].F)); } unsigned ll ans = 0; for(int i = 0 ; i < n ; i++) ans += c[i].F; printf("%llu" , ans); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |