Submission #1833994
Source Code Expand
#include <algorithm> #include <cstdio> #include <iostream> #include <map> #include <cmath> #include <queue> #include <set> #include <sstream> #include <stack> #include <string> #include <vector> #include <stdlib.h> #include <stdio.h> #include <bitset> #include <cstring> #include <deque> using namespace std; #define FOR(I,A,B) for(int I = (A); I < (B); ++I) #define CLR(mat) memset(mat, 0, sizeof(mat)) typedef long long ll; int main() { ios::sync_with_stdio(false); cin.tie(0); int N,A,B;cin>>N>>A>>B; int ans = 0; FOR(i,0,N) { int t; cin >> t; if(t < A || t >= B) ans++; } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - A Barricade |
User | nenuon |
Language | C++14 (GCC 5.4.1) |
Score | 66 |
Code Size | 666 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 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 | 1 ms | 256 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 |