# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1090898 | 2024-09-19T05:43:54 Z | KasymK | Exam (eJOI20_exam) | C++17 | 17 ms | 3416 KB |
#include "bits/stdc++.h" using namespace std; #define ff first #define ss second #define all(v) v.begin(), v.end() #define ll long long #define pb push_back #define pii pair<int, int> #define pli pair<ll, int> #define pll pair<ll, ll> #define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i) #define wr puts("----------------") template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;} template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;} const int N = 1e5+5; int a[N], b[N], n; bool vis[N]; int sub2(){ int answer = 0; for(int i = 1; i <= n; ++i) if(b[1] == a[i]){ answer++; for(int l = i-1; l >= 1 and !vis[l] and a[l] < a[i]; --l) answer++, vis[l] = 1; for(int r = i+1; r <= n and !vis[r] and a[r] < a[i]; ++r) answer++, vis[r] = 1; } return answer; } int sub4(){ return 0; } int suball(){ return 0; } int main(){ scanf("%d", &n); for(int i = 1; i <= n; ++i){ int x; scanf("%d", &x); a[i] = x; } for(int i = 1; i <= n; ++i){ int x; scanf("%d", &x); b[i] = x; } bool ok = 1; for(int i = 1; i < n; ++i) ok &= (b[i] == b[i+1]); if(ok){ int answer = sub2(); printf("%d\n", answer); return 0; } if(n >= 5e3){ int answer = sub4(); printf("%d\n", answer); return 0; } int answer = suball(); printf("%d\n", answer); return 0; }
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 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 4 ms | 968 KB | Output is correct |
3 | Correct | 11 ms | 2124 KB | Output is correct |
4 | Correct | 10 ms | 1624 KB | Output is correct |
5 | Correct | 17 ms | 3080 KB | Output is correct |
6 | Correct | 10 ms | 1372 KB | Output is correct |
7 | Correct | 14 ms | 1680 KB | Output is correct |
8 | Correct | 16 ms | 3416 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 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 | - |