Submission #4060841


Source Code Expand

/*
    問題をよく読もう!
    論理的に考えよう!
    サンプルを確認しよう!
    絶対に諦めるな!
    工夫をしろ!

    Twitterは終わるまでログアウト!
    (間違えて解法をツイートしてはいけないから)

*/
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
using namespace std;
#define rep(i, n) for(int i=0; i<n; ++i)
typedef long long ll;
//必要な宣言

int main() {
  int A, B, C, D;
  cin >> A >> B >> C >> D;
  int bus, train;

  if(A > B) train = B;
  else train = A;

  if(C > D) bus = D;
  else bus = C;

  cout << bus + train << endl;

  return 0;
}

Submission Info

Submission Time
Task A - Traveling Budget
User Kuromaru
Language C++14 (GCC 5.4.1)
Score 100
Code Size 713 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 12
Set Name Test Cases
Sample sample-01.txt, sample-02.txt, sample-03.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, sample-01.txt, sample-02.txt, sample-03.txt
Case Name Status Exec Time Memory
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
08.txt AC 1 ms 256 KB
09.txt AC 1 ms 256 KB
sample-01.txt AC 1 ms 256 KB
sample-02.txt AC 1 ms 256 KB
sample-03.txt AC 1 ms 256 KB