Submission #3048674
Source Code Expand
#include<cstdio> #include<cstring> #include<cmath> #include<bitset> #include<iostream> #include<algorithm> #include<string> #include<utility> #include<tuple> #include<vector> #include<list> #include<map> #include<set> #include<queue> #include<stack> #include<numeric> #include<functional> #include<iomanip> #include<random> #define IOS ios::sync_with_stdio(false),cin.tie(0) #define REP(i,n) for(int i = 0;i < n;i++) #define FOR(i,a,b) for(int i = a;i < b;i++) #define MEM(a,b) memset(a,b,sizeof(a)) #define ALL(x) (x).begin(),(x).end() #define LMAX 9223372036854775807 #define LMIN -9223372036854775808 using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair<ll, ll> P; typedef pair<ull, ull> UP; typedef tuple<int, int, int> T; struct UnionFind { vector<int> data; UnionFind(int size) : data(size, -1) {} void unionSet(int x, int y) { x = root(x), y = root(y); if (x != y) { if (data[y] < data[x])swap(x, y); data[x] += data[y]; data[y] = x; } } bool findSet(int x, int y) { return root(x) == root(y); } int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); } int size(int x) { return -data[root(x)]; } }; ll gcd(ll a, ll b) { if (a < b)swap(a, b); int k = a % b; if (k == 1)return 1; if (k == 0)return b; int ans = gcd(b, k); return ans; } ll digisum(ll a) { int sum = 0; while (a) { sum += a % 10; a /= 10; } return sum; } ll countpow(ll a, ll b) { int ans = 0; if (b == 0)return -1; while (1) { if (a % b == 0) { a /= b; ans++; } else break; } return ans; } int main() { IOS; int a; cin >> a; cout << (a % 2 == 0 ? a /2:a/2 + 1) << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - 引越し作業 |
User | jgvt5ti |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1756 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 384 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | large_1000.txt, large_997.txt, large_998.txt, large_999.txt, random_148.txt, random_155.txt, random_198.txt, random_362.txt, random_403.txt, random_667.txt, random_795.txt, random_811.txt, random_85.txt, random_959.txt, sample_1.txt, sample_2.txt, sample_3.txt, small_10.txt, small_11.txt, small_3.txt, small_4.txt, small_6.txt, small_7.txt, small_8.txt, small_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
large_1000.txt | AC | 1 ms | 256 KB |
large_997.txt | AC | 1 ms | 256 KB |
large_998.txt | AC | 1 ms | 256 KB |
large_999.txt | AC | 1 ms | 256 KB |
random_148.txt | AC | 1 ms | 256 KB |
random_155.txt | AC | 1 ms | 256 KB |
random_198.txt | AC | 1 ms | 256 KB |
random_362.txt | AC | 2 ms | 384 KB |
random_403.txt | AC | 1 ms | 256 KB |
random_667.txt | AC | 1 ms | 256 KB |
random_795.txt | AC | 1 ms | 256 KB |
random_811.txt | AC | 1 ms | 256 KB |
random_85.txt | AC | 1 ms | 256 KB |
random_959.txt | AC | 1 ms | 256 KB |
sample_1.txt | AC | 1 ms | 256 KB |
sample_2.txt | AC | 1 ms | 256 KB |
sample_3.txt | AC | 1 ms | 256 KB |
small_10.txt | AC | 1 ms | 256 KB |
small_11.txt | AC | 1 ms | 256 KB |
small_3.txt | AC | 1 ms | 256 KB |
small_4.txt | AC | 1 ms | 256 KB |
small_6.txt | AC | 1 ms | 256 KB |
small_7.txt | AC | 1 ms | 256 KB |
small_8.txt | AC | 1 ms | 256 KB |
small_9.txt | AC | 1 ms | 256 KB |