Submission #1115136
Source Code Expand
#include<bits/stdc++.h> const long long INF = INT_MAX / 2; const long long MOD = 1000000007; const long double PI = 3.1415926; #define FOR(i,r,n) for(ll i = (ll)(r); i < (ll)(n); i++) #define REP(i,n) FOR(i,0,n) #define ALL(x) x.begin(),x.end() #define ll long long int using namespace std; ll ans = 0, sum = 0, n, k, cnt = 0, w, h; string s; vector<ll> v; vector < pair<ll, ll > > vp; vector<vector<ll> > vv(50, vector<ll>(50, INF)); vector<string> vs; vector<char> vc; set<ll> st; map<char, ll> mp; /*--------------------template--------------------*/ int main() { cin >> n >> k; cout << (2 * n + k) / 4; }
Submission Info
Submission Time | |
---|---|
Task | C - Scc Puzzle |
User | tettchan |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 639 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 |