Submission #1993206
Source Code Expand
#include <math.h> #include <ctype.h> #include <bits/stdc++.h> using namespace std; #define FOR(i, a, n) for (int i = a; i < n; i++) #define REP(i, n) for(int i = 0; i < n; i++) struct omt{omt(){ios::sync_with_stdio(false);cin.tie(0);}}star; int main(){ int n; cin >> n; set<int> st; REP(i, n){ int tmp; cin >> tmp; st.insert(tmp); } int A[st.size()], i = 0; for(auto &x : st){ A[i] = x; i++; } int ans = 0; FOR(i, 1, st.size()){ ans += A[i] - A[i - 1]; } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Traveling AtCoDeer Problem |
User | tokizo |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 618 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 | s1.txt, s2.txt |
All | in1.txt, in2.txt, in3.txt, in4.txt, s1.txt, s2.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in1.txt | AC | 1 ms | 256 KB |
in2.txt | AC | 1 ms | 256 KB |
in3.txt | AC | 1 ms | 256 KB |
in4.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |