Submission #10579181
Source Code Expand
#include <algorithm> #include <bitset> #include <cassert> #include <cmath> #include <ctime> #include <cstring> #include <functional> #include <iostream> #include <map> #include <queue> #include <set> #include <stack> #include <string> #include <vector> #define rep(i,n) for (int i = 0; i < (n); ++i) #define sort(a) sort((a).begin(), (a).end()); #define uniq(a) SORT(a);(a).erase(unique((a).begin(), (a).end()), (a).end()); #define find(a,x) find((a).begin(), (a).end(), (x)) != (a).end() #define reverse(a) reverse((a).begin(), (a).end()); #define out(d) cout << (d); #define outl(d) std::cout<<(d)<<"\n"; #define Yes() printf("Yes\n"); #define No() printf("No\n"); #define YES() printf("YES\n"); #define NO() printf("NO\n"); #define ceil(x, y) ((x + y - 1) / (y)) using namespace std; using ll = long long; using P = pair<ll,ll>; const ll MOD = 1000000007; // 10^9 + 7 int main() { cin.tie(0); ios::sync_with_stdio(false); srand((unsigned)time(NULL)); ll n, a, b; cin >> n >> a >> b; vector<ll> t(n); rep(i, n) cin >> t[i]; ll ans = 0; for (int i = 0; i < n; i++) if (t[i] < a || t[i] >= b) ans++; outl(ans) }
Submission Info
Submission Time | |
---|---|
Task | A - A Barricade |
User | wonda_tea_coffee |
Language | C++14 (Clang 3.8.0) |
Score | 66 |
Code Size | 1198 Byte |
Status | AC |
Exec Time | 4 ms |
Memory | 888 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 66 / 66 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | 00_sample.txt, 01_sample.txt, 02_sampe.txt, 03_sample.txt, corner_case_03.txt, corner_case_04.txt, random_case_00.txt, random_case_01.txt, random_case_02.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_sample.txt | AC | 4 ms | 888 KB |
01_sample.txt | AC | 1 ms | 256 KB |
02_sampe.txt | AC | 1 ms | 256 KB |
03_sample.txt | AC | 1 ms | 256 KB |
corner_case_03.txt | AC | 1 ms | 256 KB |
corner_case_04.txt | AC | 1 ms | 256 KB |
random_case_00.txt | AC | 1 ms | 256 KB |
random_case_01.txt | AC | 1 ms | 256 KB |
random_case_02.txt | AC | 1 ms | 256 KB |