Submission #1165859


Source Code Expand

/*
 * template.cpp
 *
 *  Created on: 2016/10/30
 *      Author: jin
 */
#define MYDEBUG
#include <iostream>
#include <vector>
#include <cstring>
#include <algorithm>

#ifdef MYDEBUG
#define debug(x) cout<<#x<<": "<<x<<endl
#else
#define debug(x)
#endif
#define ll long long
#define ull unsigned long long
#define eps 1e-14
#define all(x) x.begin(), x.end()
using namespace std;

template<typename T>
ostream& operator<<(ostream& out, const vector<T>& v) {
  out << "[";
  size_t last = v.size() - 1;
  for (size_t i = 0; i < v.size(); ++i) {
    out << v[i];
    if (i != last)
      out << ",";
  }
  out << "]";
  return out;
}

class Main {
public:
  void sample() {
    cout << "-------------this is sample program.----------------" << endl;
  }
  
  void ABC047_A(){
	  int a,b,c;
	  cin >> a >> b >> c;
	  if(a==(b+c)) printf("Yes");
	  else if(b==(c+a)) printf("Yes");
	  else if(c==(a+b)) printf("Yes");
	  else printf("No");
  }
  
  void ABC047_B(){
	  int W,H,N;
	  cin >> W >> H >> N;
	  vector<vector<int> > rect();
	  
	  for(int i=0; i<N; ++i){
		  
	  }
  }
  
  void ABC044_A(){
	  int n,k,x,y;
	  cin >> n >> k >> x >> y;
	  int ans;
	  if(n<=k){
		ans = n*x;
	  }else{
		ans = k*x + (n-k)*y;
	  }
	  cout << ans << endl;
  }
  
  void ABC044_B(){
	  string str;
	  cin >> str;
	  vector<int> v(26);
	  std::fill(v.begin(),v.end(),0);
	  for(int i=0; i<str.length(); ++i){
		  v[str[i]-97]++;
	  }
	  for(int i=0; i<v.size(); ++i){
		  if(v[i]%2!=0){
			  cout << "No" << endl;
			  return;
		  }
	  }
	  cout << "Yes" << endl;
  }
  
  void ABC055A(){//割引レストラン
	  int N;
	  cin >> N;
	  cout << N*800 - (N/15)*200 << endl;
  }
  
  void ABC055B(){//総積パワー
	  ull p = 1;
	  int mod = 1000000007;
	  int N;
	  cin >> N;
	  for(int i=1; i<=N; i++){
		  p = p * i % mod;
	  }
	  cout << p << endl;
  }
  void ABC055C(){//吸い殻の吸い殻
	  int N,M;
	  cin >> N >> M;
	  int scc = min(N,M/2);
	  N -= scc;
	  M -= scc * 2;
	  scc += M / 4;
	  cout << scc << endl;
  }
  void ABC055D(){
	  
  }
  void ABC013B(){//錠
	  int a,b;
	  cin >> a >> b;
	  if(b<a) swap(a,b);
	  int x = abs(b-a);
	  int y = abs(b-a-10);
	  cout << min(x,y) << endl;
	  
  }
};

int main() {
	Main m;
	m.ABC013B();
}

Submission Info

Submission Time
Task B - 錠
User LitMc
Language C++14 (GCC 5.4.1)
Score 100
Code Size 2370 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name all
Score / Max Score 100 / 100
Status
AC × 90
Set Name Test Cases
all 0_1.txt, 0_2.txt, 0_3.txt, 0_4.txt, 0_5.txt, 0_6.txt, 0_7.txt, 0_8.txt, 0_9.txt, 1_0.txt, 1_2.txt, 1_3.txt, 1_4.txt, 1_5.txt, 1_6.txt, 1_7.txt, 1_8.txt, 1_9.txt, 2_0.txt, 2_1.txt, 2_3.txt, 2_4.txt, 2_5.txt, 2_6.txt, 2_7.txt, 2_8.txt, 2_9.txt, 3_0.txt, 3_1.txt, 3_2.txt, 3_4.txt, 3_5.txt, 3_6.txt, 3_7.txt, 3_8.txt, 3_9.txt, 4_0.txt, 4_1.txt, 4_2.txt, 4_3.txt, 4_5.txt, 4_6.txt, 4_7.txt, 4_8.txt, 4_9.txt, 5_0.txt, 5_1.txt, 5_2.txt, 5_3.txt, 5_4.txt, 5_6.txt, 5_7.txt, 5_8.txt, 5_9.txt, 6_0.txt, 6_1.txt, 6_2.txt, 6_3.txt, 6_4.txt, 6_5.txt, 6_7.txt, 6_8.txt, 6_9.txt, 7_0.txt, 7_1.txt, 7_2.txt, 7_3.txt, 7_4.txt, 7_5.txt, 7_6.txt, 7_8.txt, 7_9.txt, 8_0.txt, 8_1.txt, 8_2.txt, 8_3.txt, 8_4.txt, 8_5.txt, 8_6.txt, 8_7.txt, 8_9.txt, 9_0.txt, 9_1.txt, 9_2.txt, 9_3.txt, 9_4.txt, 9_5.txt, 9_6.txt, 9_7.txt, 9_8.txt
Case Name Status Exec Time Memory
0_1.txt AC 1 ms 256 KB
0_2.txt AC 1 ms 256 KB
0_3.txt AC 1 ms 256 KB
0_4.txt AC 1 ms 256 KB
0_5.txt AC 1 ms 256 KB
0_6.txt AC 1 ms 256 KB
0_7.txt AC 1 ms 256 KB
0_8.txt AC 1 ms 256 KB
0_9.txt AC 1 ms 256 KB
1_0.txt AC 1 ms 256 KB
1_2.txt AC 1 ms 256 KB
1_3.txt AC 1 ms 256 KB
1_4.txt AC 1 ms 256 KB
1_5.txt AC 1 ms 256 KB
1_6.txt AC 1 ms 256 KB
1_7.txt AC 1 ms 256 KB
1_8.txt AC 1 ms 256 KB
1_9.txt AC 1 ms 256 KB
2_0.txt AC 1 ms 256 KB
2_1.txt AC 1 ms 256 KB
2_3.txt AC 1 ms 256 KB
2_4.txt AC 1 ms 256 KB
2_5.txt AC 1 ms 256 KB
2_6.txt AC 1 ms 256 KB
2_7.txt AC 1 ms 256 KB
2_8.txt AC 1 ms 256 KB
2_9.txt AC 1 ms 256 KB
3_0.txt AC 1 ms 256 KB
3_1.txt AC 1 ms 256 KB
3_2.txt AC 1 ms 256 KB
3_4.txt AC 1 ms 256 KB
3_5.txt AC 1 ms 256 KB
3_6.txt AC 1 ms 256 KB
3_7.txt AC 1 ms 256 KB
3_8.txt AC 1 ms 256 KB
3_9.txt AC 1 ms 256 KB
4_0.txt AC 1 ms 256 KB
4_1.txt AC 1 ms 256 KB
4_2.txt AC 1 ms 256 KB
4_3.txt AC 1 ms 256 KB
4_5.txt AC 1 ms 256 KB
4_6.txt AC 1 ms 256 KB
4_7.txt AC 1 ms 256 KB
4_8.txt AC 1 ms 256 KB
4_9.txt AC 1 ms 256 KB
5_0.txt AC 1 ms 256 KB
5_1.txt AC 1 ms 256 KB
5_2.txt AC 1 ms 256 KB
5_3.txt AC 1 ms 256 KB
5_4.txt AC 1 ms 256 KB
5_6.txt AC 1 ms 256 KB
5_7.txt AC 1 ms 256 KB
5_8.txt AC 1 ms 256 KB
5_9.txt AC 1 ms 256 KB
6_0.txt AC 1 ms 256 KB
6_1.txt AC 1 ms 256 KB
6_2.txt AC 1 ms 256 KB
6_3.txt AC 1 ms 256 KB
6_4.txt AC 1 ms 256 KB
6_5.txt AC 1 ms 256 KB
6_7.txt AC 1 ms 256 KB
6_8.txt AC 1 ms 256 KB
6_9.txt AC 1 ms 256 KB
7_0.txt AC 1 ms 256 KB
7_1.txt AC 1 ms 256 KB
7_2.txt AC 1 ms 256 KB
7_3.txt AC 1 ms 256 KB
7_4.txt AC 1 ms 256 KB
7_5.txt AC 1 ms 256 KB
7_6.txt AC 1 ms 256 KB
7_8.txt AC 1 ms 256 KB
7_9.txt AC 1 ms 256 KB
8_0.txt AC 1 ms 256 KB
8_1.txt AC 1 ms 256 KB
8_2.txt AC 1 ms 256 KB
8_3.txt AC 1 ms 256 KB
8_4.txt AC 1 ms 256 KB
8_5.txt AC 1 ms 256 KB
8_6.txt AC 1 ms 256 KB
8_7.txt AC 1 ms 256 KB
8_9.txt AC 1 ms 256 KB
9_0.txt AC 1 ms 256 KB
9_1.txt AC 1 ms 256 KB
9_2.txt AC 1 ms 256 KB
9_3.txt AC 1 ms 256 KB
9_4.txt AC 1 ms 256 KB
9_5.txt AC 1 ms 256 KB
9_6.txt AC 1 ms 256 KB
9_7.txt AC 1 ms 256 KB
9_8.txt AC 1 ms 256 KB