Submission #1114822
Source Code Expand
#include<iostream> #include<iomanip> #include<stack> #include<queue> #include<numeric> #include<algorithm> #include<string> #include<map> #include<bitset> #include<set> #include<cmath> #define int long long const int inf=893810114514l; const int mod=1000000007ll; const int dd[]={0,-1,0,1,0}; using namespace std; int p[2001]; void san(int u){ string s; while(u){ s.push_back(u%3+'0'); u/=3; } reverse(begin(s),end(s)); cout<<s; } signed main(){ int n,m; cin>>n>>m; if(m/2<n) cout<<m/2<<endl; else cout<<n+(m-n*2)/4<<endl; }
Submission Info
Submission Time | |
---|---|
Task | C - Scc Puzzle |
User | ninohiro |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 574 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 |