結果
問題 | No.370 道路の掃除 |
ユーザー | IL_msta |
提出日時 | 2017-01-18 21:56:34 |
言語 | C++11 (gcc 11.4.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,555 bytes |
コンパイル時間 | 996 ms |
コンパイル使用メモリ | 101,564 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-12-23 01:23:14 |
合計ジャッジ時間 | 2,220 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 2 ms
5,248 KB |
testcase_04 | AC | 2 ms
5,248 KB |
testcase_05 | AC | 2 ms
5,248 KB |
testcase_06 | AC | 1 ms
5,248 KB |
testcase_07 | AC | 1 ms
5,248 KB |
testcase_08 | AC | 1 ms
5,248 KB |
testcase_09 | AC | 2 ms
5,248 KB |
testcase_10 | AC | 2 ms
5,248 KB |
testcase_11 | AC | 2 ms
5,248 KB |
testcase_12 | AC | 2 ms
5,248 KB |
testcase_13 | AC | 2 ms
5,248 KB |
testcase_14 | AC | 2 ms
5,248 KB |
testcase_15 | AC | 1 ms
5,248 KB |
testcase_16 | AC | 2 ms
5,248 KB |
testcase_17 | AC | 2 ms
5,248 KB |
testcase_18 | AC | 1 ms
5,248 KB |
testcase_19 | AC | 2 ms
5,248 KB |
testcase_20 | AC | 2 ms
5,248 KB |
testcase_21 | AC | 2 ms
5,248 KB |
testcase_22 | WA | - |
testcase_23 | AC | 1 ms
5,248 KB |
testcase_24 | AC | 2 ms
5,248 KB |
testcase_25 | AC | 2 ms
5,248 KB |
testcase_26 | WA | - |
testcase_27 | AC | 1 ms
5,248 KB |
testcase_28 | WA | - |
testcase_29 | AC | 2 ms
5,248 KB |
testcase_30 | AC | 1 ms
5,248 KB |
testcase_31 | AC | 2 ms
5,248 KB |
testcase_32 | WA | - |
testcase_33 | WA | - |
ソースコード
#define _USE_MATH_DEFINES#include <iostream>#include <iomanip>#include <sstream>#include <algorithm>#include <cmath>#include <string>#include <cstring>#include <vector>#include <valarray>#include <array>#include <queue>#include <complex>#include <set>#include <map>#include <stack>#include <list>#include<cassert>//assert();#include <fstream>/////////#define REP(i, x, n) for(int i = x; i < n; i++)#define rep(i,n) REP(i,0,n)#define P(p) cout<<(p)<<endl;#define PII pair<int,int>/////////#ifdef getchar_unlocked#define mygc(c) (c)=getchar_unlocked()#else#define mygc(c) (c)=getchar()#endif#ifdef putchar_unlocked#define mypc(c) putchar_unlocked(c)#else#define mypc(c) putchar(c)#endif/////////typedef long long LL;typedef long double LD;typedef unsigned long long ULL;/////////using namespace::std;/////////#ifdef _DEBUG#define DEBUG_BOOL(b) assert(b)#else#define DEBUG_BOOL(b)#endif/////数値読み込み#define ENABLE_READER_ON(T) \inline void reader(T &x){int k;x = 0;bool flag = true;\while(true){mygc(k);\if( k == '-'){flag = false;break;}if('0' <= k && k <= '9'){x = k - '0';break;}\}\if( flag ){while(true){mygc(k);if( k<'0' || '9'<k)break;x = x * 10 + (k - '0');}}\else{while(true){mygc(k);if( k<'0' || '9'<k)break;x = x * 10 - (k-'0');}}\}//整数ENABLE_READER_ON(int)ENABLE_READER_ON(long)ENABLE_READER_ON(long long)ENABLE_READER_ON(unsigned int)ENABLE_READER_ON(unsigned long)ENABLE_READER_ON(unsigned long long)////////文字読み込みinline int reader(char c[]){int i,s=0;for(;;){mygc(i);if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF) break;}c[s++]=i;for(;;){mygc(i);if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF) break;c[s++]=i;}c[s]='\0';return s;}inline int reader(string& c,int size=100){int i;c.reserve(size);for(;;){mygc(i);if(i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF)break;}c.push_back(i);for(;;){mygc(i);if(i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF)break;c.push_back(i);}return c.size();}///////////数値出力#define ENABLE_WRITER_ON(T) \inline void writer(T x){char f[20];int s = 0;\if (x<0){mypc('-');while(x){f[s++] = ~(x%10)+1,x /= 10;}}\else{while(x){f[s++] = (x % 10), x /= 10;}}\if (!s)f[s++] = 0;while (s--)mypc(f[s] + '0');}ENABLE_WRITER_ON(int)ENABLE_WRITER_ON(long)ENABLE_WRITER_ON(long long)ENABLE_WRITER_ON(unsigned int)ENABLE_WRITER_ON(unsigned long)ENABLE_WRITER_ON(unsigned long long)/////////inline void writer(const char c[]){for (int i = 0; c[i] != '\0'; i++)mypc(c[i]); }inline void writer(const string str){writer( str.c_str() );}///////////////////////////////////////////////////////////// 最大公約数template<class T>inline T gcd(T a, T b){return b == 0 ? a : gcd(b, a % b);}// 最小公倍数template<class T>inline T lcm(T a, T b){return a * b / gcd(a, b);}////////////////////////////////inline void solve(){int N,M;reader(N);reader(M);vector<int> gomi(M);for(int i=0;i<M;++i){reader(gomi[i]);}sort(gomi.begin(),gomi.end());int temp;int A,B;int MIN = 20001;for(int i=0;i<M-(N-1);++i){A = gomi[i];B = gomi[i+N-1];if( A < 0 && 0 < B ){A = abs(A);B = abs(B);temp = min(A,B) +A+B;}else{A = abs(A);B = abs(B);temp = max(A,B);}MIN = min(MIN,temp);}writer(MIN);}int main(void){std::cin.tie(0);std::ios::sync_with_stdio(false);std::cout << std::fixed;//小数を10進数表示cout << setprecision(16);//小数をいっぱい表示する。16?solve();return 0;}