Submission #1114487
Source Code Expand
#include <bits/stdc++.h> using namespace std; using ll = long long; using ull = unsigned long long; using ld = long double; #define forn(i, a, n) for (int i = a; i < n; ++i) #define ford(i, a, n) for (int i = n - 1; i >= a; --i) #define fore(i, a, n) for (int i = a; i <= n; ++i) #define all(a) (a).begin(), (a).end() #define fs first #define sn second #define trace(a)\ for (auto i : a) cerr << i << ' ';\ cerr << '\n' #define eb emplace_back #ifndef M_PI const ld M_PI = acos(-1.0); #endif const ld eps = 1e-9; const int INF = 2000000000; const ll LINF = 1ll * INF * INF; const ll MOD = 1000000007; int main() { ios::sync_with_stdio(false); cin.tie(0); ll n, m; cin >> n >> m; cout << min(m / 2, (m + 2 * n) / 4) << '\n'; }
Submission Info
Submission Time | |
---|---|
Task | C - Scc Puzzle |
User | khadaev |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 793 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 |