結果
問題 | No.33 アメーバがたくさん |
ユーザー |
![]() |
提出日時 | 2014-10-02 23:35:12 |
言語 | C++11 (gcc 13.3.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,397 bytes |
コンパイル時間 | 915 ms |
コンパイル使用メモリ | 92,748 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-09-24 09:46:22 |
合計ジャッジ時間 | 1,514 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 8 WA * 3 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:43:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 43 | scanf("%d%d%d", &N, &D, &T); | ~~~~~^~~~~~~~~~~~~~~~~~~~~~ main.cpp:47:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 47 | scanf("%d", &X); | ~~~~~^~~~~~~~~~
ソースコード
#define _CRT_SECURE_NO_WARNINGS#include <string>#include <vector>#include <algorithm>#include <numeric>#include <set>#include <map>#include <queue>#include <iostream>#include <sstream>#include <cstdio>#include <cmath>#include <ctime>#include <cstring>#include <cctype>#include <cassert>#include <limits>#include <bitset>#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))#if defined(_MSC_VER) || __cplusplus > 199711L#define aut(r,v) auto r = (v)#else#define aut(r,v) typeof(v) r = (v)#endif#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)#define all(o) (o).begin(), (o).end()#define pb(x) push_back(x)#define mp(x,y) make_pair((x),(y))#define mset(m,v) memset(m,v,sizeof(m))#define INF 0x3f3f3f3f#define INFL 0x3f3f3f3f3f3f3f3fLLusing namespace std;typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii;typedef long long ll; typedef vector<long long> vl; typedef pair<long long,long long> pll; typedef vector<pair<long long,long long> > vpll;typedef vector<string> vs; typedef long double ld;template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }int main() {int N, D, T;scanf("%d%d%d", &N, &D, &T);map<int,vector<long long> > poses;rep(i, N) {int X;scanf("%d", &X);long long XX = X + 10000000000000LL;int m = (XX % D + D) % D;poses[m].push_back((XX - m) / D);}long long ans = 0;each(ps, poses) {vector<long long> &v = ps->second;sort(all(v));vector<long long> events;// cerr << ps->first << ": ";each(x, v) {long long L = (long long)*x - T + T;long long R = (long long)*x + T + T;// cerr << L << ", " << R << "; ";events.push_back(L * 2 + 1);events.push_back(R * 2 + 0);}// cerr << endl;sort(all(events));int cnt = 0;long long L = -1;long long x = 0;each(e, events) {if(*e % 2 == 0) {if(-- cnt == 0) {x += *e / 2 + 1 - L;L = -1;}}else {if(cnt ++ == 0)L = *e / 2;}}// cerr << ps->first << ": " << x << endl;ans += x;}printf("%lld\n", ans);return 0;}