Submission #1137444
Source Code Expand
#include <cstdio> #include <cstring> #include <string> #include <cmath> #include <cassert> #include <iostream> #include <algorithm> #include <stack> #include <numeric> #include <queue> #include <vector> #include <set> #include <map> #include <bitset> #include <functional> using namespace std; typedef long long ll; #define pl pair<ll,ll> #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define rep(i,n) for(int i=0;i<(n);++i) #define foreach(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); itr++) #define dbg(x) cout << #x"="<< (x) << endl #define mp(a,b) make_pair((a),(b)) #define pb(a) push_back(a) #define in(x) cin >> x; #define all(x) (x).begin(), (x).end() #define INF 2147483600 #define fi first #define se second int main(){ ll n,m; ll ans=0; int res; cin>>n>>m; res=m%2; m/=2; if(n>=m){ ans+=m; }else{ ans+=n; ans+=(m-n)/2; } cout<<ans<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Scc Puzzle |
User | motigome |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 943 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 |