Submission #1866423
Source Code Expand
#include <bits/stdc++.h> #include <algorithm> #include <stdio.h> #include <math.h> using namespace std; #define INF 1.1e9 #define LINF 1.1e18 #define FOR(i,a,b) for (int i = (a); i < (b); ++i) #define REP(i,n) FOR(i,0,n) #define ALL(v) (v).begin(), (v).end() #define pb push_back #define pf push_front #define fi first #define se second #define BIT(x,n) bitset<n>(x) typedef long long ll; typedef pair<ll,ll> P; typedef pair<int,P> PP; struct edge { int to, cost; edge(int t,int c):to(t),cost(c) {} }; int dx[]={1,-1,0,0},dy[]={0,0,1,-1}; int ddx[]={1,1,1,0,-1,-1,-1,0},ddy[]={1,0,-1,-1,-1,0,1,1}; ll mypow(ll x,ll n,ll m) { //xのn乗をmで割った余り if(n==0) return 1; if(n%2==0) return mypow(x*x%m,n/2,m); else return x*mypow(x,n-1,m)%m; } //----------------------------------------------------------------------------- int n,t; int a[100000]; int imos[1200000]; int main() { cin.tie(0); ios::sync_with_stdio(false); cin>>n>>t; REP(i,n) { cin>>a[i]; imos[a[i]]++; imos[a[i]+t]--; } FOR(i,1,1200000) imos[i]+=imos[i-1]; int cnt=0; REP(i,1200000) if(imos[i]) cnt++; cout<<cnt<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 自動ドア |
User | moko_freedom |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1191 Byte |
Status | AC |
Exec Time | 15 ms |
Memory | 5376 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 50 / 50 | 50 / 50 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
Subtask1 | subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, sample_01.txt, sample_02.txt |
Subtask2 | sample_01.txt, sample_02.txt, sample_23.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt, subtask2_23.txt, subtask2_24.txt, subtask2_25.txt, subtask2_26.txt, subtask2_27.txt, subtask2_28.txt, subtask2_29.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 6 ms | 4992 KB |
sample_02.txt | AC | 6 ms | 4992 KB |
sample_23.txt | AC | 6 ms | 4992 KB |
subtask1_01.txt | AC | 13 ms | 5248 KB |
subtask1_02.txt | AC | 8 ms | 4992 KB |
subtask1_03.txt | AC | 13 ms | 5248 KB |
subtask1_04.txt | AC | 9 ms | 5120 KB |
subtask1_05.txt | AC | 8 ms | 4992 KB |
subtask1_06.txt | AC | 8 ms | 4992 KB |
subtask1_07.txt | AC | 13 ms | 5248 KB |
subtask1_08.txt | AC | 13 ms | 5248 KB |
subtask1_09.txt | AC | 10 ms | 5120 KB |
subtask1_10.txt | AC | 7 ms | 4992 KB |
subtask1_11.txt | AC | 10 ms | 5120 KB |
subtask1_12.txt | AC | 13 ms | 5248 KB |
subtask1_13.txt | AC | 13 ms | 5248 KB |
subtask1_14.txt | AC | 11 ms | 5248 KB |
subtask1_15.txt | AC | 15 ms | 5376 KB |
subtask1_16.txt | AC | 14 ms | 5376 KB |
subtask1_17.txt | AC | 14 ms | 5376 KB |
subtask1_18.txt | AC | 15 ms | 5376 KB |
subtask1_19.txt | AC | 15 ms | 5376 KB |
subtask1_20.txt | AC | 15 ms | 5376 KB |
subtask1_21.txt | AC | 15 ms | 5376 KB |
subtask1_22.txt | AC | 14 ms | 5376 KB |
subtask1_23.txt | AC | 15 ms | 5376 KB |
subtask1_24.txt | AC | 15 ms | 5376 KB |
subtask1_25.txt | AC | 15 ms | 5376 KB |
subtask1_26.txt | AC | 14 ms | 5376 KB |
subtask1_27.txt | AC | 15 ms | 5376 KB |
subtask1_28.txt | AC | 15 ms | 5376 KB |
subtask1_29.txt | AC | 14 ms | 5376 KB |
subtask2_01.txt | AC | 12 ms | 5248 KB |
subtask2_02.txt | AC | 11 ms | 5120 KB |
subtask2_03.txt | AC | 11 ms | 5120 KB |
subtask2_04.txt | AC | 7 ms | 4992 KB |
subtask2_05.txt | AC | 13 ms | 5248 KB |
subtask2_06.txt | AC | 9 ms | 5120 KB |
subtask2_07.txt | AC | 11 ms | 5120 KB |
subtask2_08.txt | AC | 8 ms | 4992 KB |
subtask2_09.txt | AC | 11 ms | 5248 KB |
subtask2_10.txt | AC | 14 ms | 5376 KB |
subtask2_11.txt | AC | 10 ms | 5120 KB |
subtask2_12.txt | AC | 11 ms | 5248 KB |
subtask2_13.txt | AC | 9 ms | 5120 KB |
subtask2_14.txt | AC | 8 ms | 4992 KB |
subtask2_15.txt | AC | 15 ms | 5376 KB |
subtask2_16.txt | AC | 15 ms | 5376 KB |
subtask2_17.txt | AC | 15 ms | 5376 KB |
subtask2_18.txt | AC | 14 ms | 5376 KB |
subtask2_19.txt | AC | 14 ms | 5376 KB |
subtask2_20.txt | AC | 14 ms | 5376 KB |
subtask2_21.txt | AC | 15 ms | 5376 KB |
subtask2_22.txt | AC | 14 ms | 5376 KB |
subtask2_23.txt | AC | 15 ms | 5376 KB |
subtask2_24.txt | AC | 14 ms | 5376 KB |
subtask2_25.txt | AC | 15 ms | 5376 KB |
subtask2_26.txt | AC | 15 ms | 5376 KB |
subtask2_27.txt | AC | 14 ms | 5376 KB |
subtask2_28.txt | AC | 14 ms | 5376 KB |
subtask2_29.txt | AC | 15 ms | 5376 KB |