Submission #1115350
Source Code Expand
/** * code generated by JHelper * More info: https://github.com/AlexeyDmitriev/JHelper * @author yassin */ #include <fstream> #include <iostream> #include <vector> #include <string> #include <utility> #include <algorithm> #include <map> #include <set> #include <cmath> #include <cstdlib> #include <tuple> #include <queue> #include <functional> #include <stack> #include <cassert> using namespace std; class atC { public: void solve(istream& in, ostream& out) { long long N, M; in >> N >> M; long long low = 0, hi = N+M, ans = 0; while (low <= hi) { long long mid = (low + hi) / 2; //cout << "check: " << mid << endl; long long curN = N, curM = M; long long needS = mid, needcc = mid; needS -= curN; curM -= needcc*2; if (needS > 0) { curM -= needS*2; } if (curM < 0) { hi = mid-1; } else { ans = mid; low = mid+1; } } out << ans << "\n"; } }; int main() { std::ios::sync_with_stdio(false); atC solver; std::istream& in(std::cin); std::ostream& out(std::cout); solver.solve(in, out); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Scc Puzzle |
User | yassin |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1366 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 | 00_example_01.txt, 00_example_02.txt |
All | 00_example_01.txt, 00_example_02.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_example_01.txt | AC | 1 ms | 256 KB |
00_example_02.txt | AC | 1 ms | 256 KB |
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 |