Submission #2560802
Source Code Expand
#include <iostream> #include <algorithm> #include <complex> #include <vector> #include <deque> #include <queue> #include <list> #include <stack> #include <string> #include <functional> #include <numeric> #include <cmath> #include <iomanip> #include <map> #include <set> #include <cstdlib> #define rep(i, b) for(int i = 0; i < b; i++) #define repi(i, a, b) for(int i = a; i < b; i++) #define all(c) c.begin(),c.end() #if defined(_MSC_VER) || __cplusplus > 199711L #define aut(r,v) auto r = (v) #else #define aut(r,v) __typeof(v) r = (v) #endif #define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it) #define MAX_V 1001 #define MAX_E 401 #define INF INT_MAX #define MOD 1000000007 #define EPS 1e-7 struct Edge { int from, to, cost; Edge(int from, int to, int cost) : from(from), to(to), cost(cost) {}; }; typedef long long ll; inline int toInt(std::string s) { int v; std::istringstream sin(s); sin >> v; return v; } template<class T> inline std::string toString(T x) { std::ostringstream sout; sout << x; return sout.str(); } using namespace std; typedef double D; // 座標値の型。doubleかlong doubleを想定 typedef complex<D> P; // Point typedef pair<P, P> L; // Line #define X real() #define Y imag() typedef pair<int, int> pii; typedef pair<ll, ll> pll; int main() { ll n; ll x; ll res = 0; cin >> n >> x; if (n - x < x) { x = n - x; } if (n % x == 0) { res = ((n / x) - 1) * (x * 3); } else { res = 3 * (n - 1); } cout << res << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Mysterious Light |
User | StarWell |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1578 Byte |
Status | WA |
Exec Time | 2 ms |
Memory | 384 KB |
Judge Result
Set Name | Sample | Subtask | All | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 300 | 0 / 200 | ||||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample-01.txt |
Subtask | sample-01.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt |
All | sample-01.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 02-01.txt, 02-02.txt, 02-03.txt, 02-04.txt, 02-05.txt, 02-06.txt, 02-07.txt, 02-08.txt, 02-09.txt, sample-01.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | AC | 1 ms | 256 KB |
01-02.txt | AC | 1 ms | 256 KB |
01-03.txt | AC | 1 ms | 256 KB |
01-04.txt | AC | 2 ms | 384 KB |
01-05.txt | WA | 1 ms | 256 KB |
01-06.txt | AC | 1 ms | 256 KB |
01-07.txt | AC | 1 ms | 256 KB |
01-08.txt | WA | 1 ms | 256 KB |
01-09.txt | AC | 1 ms | 256 KB |
02-01.txt | AC | 1 ms | 256 KB |
02-02.txt | AC | 1 ms | 256 KB |
02-03.txt | WA | 1 ms | 256 KB |
02-04.txt | AC | 1 ms | 256 KB |
02-05.txt | WA | 1 ms | 256 KB |
02-06.txt | AC | 1 ms | 256 KB |
02-07.txt | WA | 1 ms | 256 KB |
02-08.txt | AC | 1 ms | 256 KB |
02-09.txt | AC | 1 ms | 256 KB |
sample-01.txt | AC | 1 ms | 256 KB |