Submission #191040


Source Code Expand

#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
 #define rep(i,n) for(int i = 0; i < n; ++i)
#define rec(i,m,n) for(int i = m; i < n; ++i) 
using namespace std; 
int main(){  int N;  cin >> N;  vector<int> S(N); vector<int> E(N);  rep(i,N){  scanf("%d-%d",&S[i],&E[i]);  if(S[i]%10 < 5) S[i] -= S[i]%10;  else if(S[i]%10 > 5) S[i] -= (S[i]%10 - 5);  if(E[i]%10 < 5 && E[i]%10 != 0) E[i] += (5 - E[i]%10);  else if(E[i]%10 > 5) E[i] += (10 - E[i]%10);  if(E[i]%100 == 60) E[i] += 40;   }  rep(i,N){  rep(j,N){  if(S[i] < S[j]){  int s,e; s = S[i]; S[i] = S[j]; S[j] = s;  e = E[i]; E[i] = E[j]; E[j] = e;  }  }  }  if(N == 1){  cout << S[0] << "-" << E[0] << endl;  } else{  int SS = S[0]; int EE = E[0];  rec(i,0,S.size()){  if((SS <= S[i] && S[i] <= EE) && EE < E[i])  EE = E[i];  if(EE < S[i + 1]){  cout << SS << "-" << EE << endl;  if(i+1 < S.size()){ SS = S[i + 1]; EE = E[i + 1]; } } } }}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User MurATa25
Language C++ (G++ 4.6.4)
Score 0
Code Size 959 Byte
Status CE

Compile Error

./Main.cpp:5:1: error: stray ‘\302’ in program
./Main.cpp:5:1: error: stray ‘\240’ in program
./Main.cpp:5:1: error: stray ‘#’ in program
./Main.cpp:7:1: error: stray ‘\302’ in program
./Main.cpp:7:1: error: stray ‘\240’ in program
./Main.cpp:8:1: error: stray ‘\302’ in program
./Main.cpp:8:1: error: stray ‘\240’ in program
./Main.cpp:8:1: error: stray ‘\302’ in program
./Main.cpp:8:1: error: stray ‘\240’ in program
./Main.cpp:8:1: error: stray ‘\302’ in program
./Main.cpp:8:1: error: stray ‘\240’ in program
./Main.cpp:8:1: error: stray ‘\302’ in program
./Main.cpp:8:1: error: stray ‘\240’ in program
./Main.cpp:8:1: error: stray ‘\302’ in program
./Main.cpp:8:1: error: stray ‘\240’ in program
./Main.cpp:8:1: error: stray ‘\302’ in program
./Main.cpp:8:1: error: stray ‘\240’ in program
./Main.cpp:8:1: error: stray ‘\302’ in program
./Main.cpp:8:1: error: stray ‘\240’ in program
./Main.cpp:8:1: error: stray ‘\302’ in program
./Main....