Submission #1114454
Source Code Expand
#include <cstdio> #include <iostream> #include <algorithm> #include <vector> #include <queue> #include <malloc.h> #include <stack> #include <cstring> #include <string> #include <set> #include <stack> #include <unordered_map> #define INT long long int #define MOD 1000000007 #define oo 2000000007 using namespace std; INT n, m, ans; int main() { ios::sync_with_stdio(false); cin>>n>>m; ans = min( n, m*2 ); m -= 2*n; if( m > 0 ) ans += m/4; cout<<ans<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Scc Puzzle |
User | JKJeong |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 528 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 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 | 1 ms | 256 KB |
00_example_02.txt | AC | 1 ms | 256 KB |
01.txt | WA | 1 ms | 256 KB |
02.txt | AC | 1 ms | 256 KB |
03.txt | WA | 1 ms | 256 KB |
04.txt | WA | 1 ms | 256 KB |
05.txt | WA | 1 ms | 256 KB |
06.txt | AC | 1 ms | 256 KB |
07.txt | AC | 1 ms | 256 KB |