Submission #441468

#TimeUsernameProblemLanguageResultExecution timeMemory
441468elazarkorenExam (eJOI20_exam)C++17
0 / 100
3 ms204 KiB
#include <iostream> #include <vector> #include <algorithm> #include <stack> #define x first #define y second //#define int long long using namespace std; typedef vector<int> vi; typedef vector<vi> vvi; typedef pair<int, int> pii; typedef vector<pii> vii; const int MAX_N = 1e5 + 1; int a[MAX_N]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; int b; cin >> b; bool good = false; int count = 0; int ans = 0; for (int i = 0; i < n; i++) { if (a[i] > b) { ans += (good ? count : 0); good = false; } else { count++; good = good || a[i] == b; } } ans += (good ? count : 0); cout << ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...