Submission #1679101
Source Code Expand
#include <bits/stdc++.h> #include <stdio.h> using namespace std; #define INF 1.1e9 #define LINF 1.1e18 #define FOR(i,a,b) for (int i = (a); i < (b); ++i) #define REP(i,n) FOR(i,0,n) #define ALL(v) (v).begin(), (v).end() typedef long long ll; typedef pair<ll, int> P; ll n,m; int main(){ //cin.tie(0); //ios::sync_with_stdio(false); cin>>n>>m; if(m<2||(m<4&&n<0)) { cout<<'0'<<endl; return 0; } ll ans=0; while (n>0) { ans++;n--;m-=2; if(m<0) { ans--; break; } } while (m>0) { ans++;m-=4; if(m<0) { ans--; break; } } cout<<ans<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Scc Puzzle |
User | moko_freedom |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 626 Byte |
Status | TLE |
Exec Time | 2103 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 | TLE | 2103 ms | 256 KB |
02.txt | TLE | 2103 ms | 256 KB |
03.txt | AC | 1 ms | 256 KB |
04.txt | AC | 1 ms | 256 KB |
05.txt | AC | 31 ms | 256 KB |
06.txt | AC | 66 ms | 256 KB |
07.txt | AC | 66 ms | 256 KB |