Submission #2873189
Source Code Expand
#pragma GCC optimize("O3") #define first x #define second y #include <bits/stdc++.h> using namespace std; enum {MOD0 = 1000000000, MOD7 = 1000000007, MOD9 = 1000000009}; typedef unsigned short ushort;typedef unsigned int uint;typedef long long ll;typedef unsigned long long ull; #ifndef CrafterKolyan #define endl '\n' #endif signed main() { #ifndef CrafterKolyan ios_base::sync_with_stdio(false); cin.tie(nullptr); #endif int n, mi, ma, x; cin >> n; cin >> mi; ma = mi; while (--n) { cin >> x; mi = min(mi, x); ma = max(ma, x); } cout << ma - mi << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Maximum Difference |
User | CrafterKolyan |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 665 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
subtask_1_01.txt | AC | 1 ms | 256 KB |
subtask_1_02.txt | AC | 1 ms | 256 KB |
subtask_1_03.txt | AC | 1 ms | 256 KB |
subtask_1_04.txt | AC | 1 ms | 256 KB |
subtask_1_05.txt | AC | 1 ms | 256 KB |
subtask_1_06.txt | AC | 1 ms | 256 KB |
subtask_1_07.txt | AC | 1 ms | 256 KB |
subtask_1_08.txt | AC | 1 ms | 256 KB |
subtask_1_09.txt | AC | 1 ms | 256 KB |
subtask_1_10.txt | AC | 1 ms | 256 KB |
subtask_1_11.txt | AC | 1 ms | 256 KB |
subtask_1_12.txt | AC | 1 ms | 256 KB |