Submission #1515207
Source Code Expand
#include <iostream> using namespace std; using LL =long long; int main() { LL N, M; cin >> N >> M; LL max_ = 0; for (int i = 1; i <= M / 2; i++) { max_ = max(max_, min(N + i, (M - i * 2) / 2)); } cout << max_ << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - Scc Puzzle |
User | sawfish |
Language | C++14 (Clang 3.8.0) |
Score | 0 |
Code Size | 274 Byte |
Status | WA |
Exec Time | 2103 ms |
Memory | 888 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 7 ms | 888 KB |
00_example_02.txt | AC | 2 ms | 256 KB |
01.txt | TLE | 2103 ms | 256 KB |
02.txt | TLE | 2103 ms | 256 KB |
03.txt | AC | 1 ms | 256 KB |
04.txt | WA | 1 ms | 256 KB |
05.txt | WA | 141 ms | 256 KB |
06.txt | AC | 311 ms | 256 KB |
07.txt | AC | 311 ms | 256 KB |