Submission #3628151
Source Code Expand
#include <iostream> #include <cmath> #include <vector> #include <algorithm> using namespace std; const int INF = pow(2, 31) - 1; #define ll long long #define DEBUG(x) cout << "DEBUG>" << #x << ":" << x << endl; #define REP(i,n) for(ll i=0;i<(n);i++) #define FOR(i,a,b) for(ll i=(a);i<=(b);i++) ll gcd(ll a,ll b){return b?gcd(b,a%b):a;} int main() { vector<int> A(3); cin >> A[0] >> A[1] >> A[2]; sort(A.begin(), A.end()); int ans = 0; ans += (A[2] - A[0]) / 2; ans += (A[2] - A[1]) / 2; A[0] += ((A[2] - A[0]) / 2) * 2; A[1] += ((A[2] - A[1]) / 2) * 2; if(A[0] == A[1] && A[1] == A[2]) { cout << ans << endl; } else { if(A[2] - A[0] == 1 && A[2] - A[1] == 1) { ans++; } else { ans += 2; } cout << ans << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Same Integers |
User | serenity31 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 816 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, s1.txt, s2.txt, s3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 1 ms | 256 KB |
02.txt | AC | 1 ms | 256 KB |
03.txt | AC | 1 ms | 256 KB |
04.txt | AC | 1 ms | 256 KB |
05.txt | AC | 1 ms | 256 KB |
06.txt | AC | 1 ms | 256 KB |
07.txt | AC | 1 ms | 256 KB |
08.txt | AC | 1 ms | 256 KB |
09.txt | AC | 1 ms | 256 KB |
10.txt | AC | 1 ms | 256 KB |
11.txt | AC | 1 ms | 256 KB |
12.txt | AC | 1 ms | 256 KB |
13.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |