Submission #104647


Source Code Expand

Copy
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <cctype>
#include <cassert>
#include <cstring>
#include <climits>

using namespace std;

#define FOR(k,a,b) for(typeof(a) k=(a); k < (b); k++)
#define FORE(k,a,b) for(typeof(a) k=(a); k <= (b); k++)
#define REP(k,a) for(int k=0; k < (a); k++)

#define SZ size()
#define ALL(c) (c).begin(), (c).end()
#define PB push_back
#define MP make_pair
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); i++)
#define EXIST(s,e) ((s).find(e)!=(s).end())

#define dump(x) cerr << #x << ": " << (x) << endl;

typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;

const int INF = 1000 * 1000 * 1000;
const double EPS = 1e-10;



int main()
{
  int n;
  cin >> n;
  int days[7] = {0};
  REP(i, n) {
    double maxt, mint;
    cin >> maxt >> mint;

    if(maxt >= 35) {
      days[0]++;
    }
    else if(maxt >= 30) {
      days[1]++;
    }
    else if(maxt >= 25) {
      days[2]++;
    }
    else if(maxt < 0) {
      days[5]++;
    }

    if(mint >= 25) {
      days[3]++;
    }
    else if(mint < 0 && maxt >= 0) {
      days[4]++;
    }
    
  }

  printf("%d %d %d %d %d %d\n", days[0], days[1], days[2], days[3], days[4], days[5]);
  
  return 0;
}

Submission Info

Submission Time
Task B - 真冬日?真夏日?
User kohei0418
Language C++ (G++ 4.6.4)
Score 100
Code Size 1668 Byte
Status
Exec Time 29 ms
Memory 932 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
× 17
Set Name Test Cases
All 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, test_00.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt
Case Name Status Exec Time Memory
00_sample_01.txt 21 ms 800 KB
00_sample_02.txt 21 ms 808 KB
00_sample_03.txt 21 ms 932 KB
test_00.txt 20 ms 796 KB
test_01.txt 21 ms 752 KB
test_02.txt 20 ms 800 KB
test_03.txt 21 ms 932 KB
test_04.txt 21 ms 932 KB
test_05.txt 20 ms 928 KB
test_06.txt 21 ms 760 KB
test_07.txt 23 ms 804 KB
test_08.txt 27 ms 924 KB
test_09.txt 27 ms 804 KB
test_10.txt 27 ms 808 KB
test_11.txt 29 ms 808 KB
test_12.txt 27 ms 928 KB
test_13.txt 27 ms 740 KB