提出 #577378

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
#define FOR(i,k,n) for(int i = (k); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) a.begin(), a.end()
typedef pair<int, int>  pii;

int main()
{
	int n; cin >> n;
	vector<char> d;
	vector<int> l;
	d.push_back('n'); l.push_back(1000000);
	REP(i, n)
	{
		char a; int b;
		cin >> a >> b;
		d.push_back(a);
		l.push_back(b);
	}
	d.push_back('n'); l.push_back(1000000);
	vector<pii> v;
	REP(i, d.size())
	{
		if (d[i] == 'y') v.emplace_back(l[i], i);
	}
	sort(ALL(v));
	vector<int> upn(n + 2), dwn(n + 2);
	REP(i, d.size())
	{
		if (d[i] == 'y')
		{
			for (int j = i - 1; j >= 0; j--)
			{
				if (d[j] == 'n'&&l[j] >= l[i])
				{
					upn[i] = j;
					break;
				}
			}
			FOR(j, i + 1, n + 3)
			{
				if (d[j] == 'n'&&l[j] >= l[i])
				{
					dwn[i] = j;
					break;
				}
			}
		}
	}
	set<int> used;
	int ans = 0;
	REP(i, v.size())
	{
		int p = v[i].second;
		int st = upn[p], go = dwn[p];
		bool f = false;
		for (int j = st; j <= go; j++)
		{
			if (d[j] == 'y'&&used.find(j) == used.end())
			{
				f = true;
				used.insert(j);
			}
		}
		if (f) ans++;
	}
	cout << ans << endl;
	return 0;
}

提出情報

提出日時
問題 C - Delete Files
ユーザ lungman
言語 C++11 (GCC 4.8.1)
得点 0
コード長 1219 Byte
結果 WA
実行時間 105 ms
メモリ 1200 KiB

ジャッジ結果

セット名 All
得点 / 配点 0 / 100
結果
AC × 33
WA × 21
セット名 テストケース
All 00_sample_00, 00_sample_01, 00_sample_02, 01_random-small_00, 01_random-small_01, 01_random-small_02, 01_random-small_03, 01_random-small_04, 01_random-small_05, 01_random-small_06, 01_random-small_07, 01_random-small_08, 01_random-small_09, 02_random-large_00, 02_random-large_01, 02_random-large_02, 02_random-large_03, 02_random-large_04, 02_random-large_05, 02_random-large_06, 02_random-large_07, 02_random-large_08, 02_random-large_09, 03_mutual_00, 03_mutual_01, 03_mutual_02, 03_mutual_03, 03_mutual_04, 03_mutual_05, 03_mutual_06, 03_mutual_07, 03_mutual_08, 03_mutual_09, 04_all_00, 04_all_01, 04_all_02, 04_all_03, 04_all_04, 04_all_05, 04_all_06, 04_all_07, 04_all_08, 04_all_09, 05_maximal_00, 05_maximal_01, 05_maximal_02, 05_maximal_03, 05_maximal_04, 05_maximal_05, 05_maximal_06, 05_maximal_07, 05_maximal_08, 05_maximal_09, 99_handmade_00
ケース名 結果 実行時間 メモリ
00_sample_00 AC 30 ms 1056 KiB
00_sample_01 AC 28 ms 976 KiB
00_sample_02 AC 27 ms 1068 KiB
01_random-small_00 WA 26 ms 1068 KiB
01_random-small_01 WA 26 ms 1172 KiB
01_random-small_02 AC 27 ms 1164 KiB
01_random-small_03 WA 27 ms 1072 KiB
01_random-small_04 WA 26 ms 1168 KiB
01_random-small_05 WA 27 ms 1076 KiB
01_random-small_06 AC 25 ms 1172 KiB
01_random-small_07 WA 28 ms 1076 KiB
01_random-small_08 AC 27 ms 1172 KiB
01_random-small_09 AC 26 ms 1176 KiB
02_random-large_00 AC 28 ms 1172 KiB
02_random-large_01 WA 28 ms 1076 KiB
02_random-large_02 WA 28 ms 1076 KiB
02_random-large_03 WA 29 ms 1164 KiB
02_random-large_04 WA 28 ms 1172 KiB
02_random-large_05 WA 28 ms 1164 KiB
02_random-large_06 AC 27 ms 1172 KiB
02_random-large_07 AC 28 ms 1076 KiB
02_random-large_08 WA 29 ms 1168 KiB
02_random-large_09 WA 28 ms 1076 KiB
03_mutual_00 WA 28 ms 1076 KiB
03_mutual_01 WA 27 ms 1176 KiB
03_mutual_02 WA 25 ms 1164 KiB
03_mutual_03 WA 27 ms 1076 KiB
03_mutual_04 AC 27 ms 1076 KiB
03_mutual_05 WA 27 ms 1072 KiB
03_mutual_06 WA 26 ms 1072 KiB
03_mutual_07 AC 25 ms 1076 KiB
03_mutual_08 WA 28 ms 1072 KiB
03_mutual_09 WA 27 ms 1076 KiB
04_all_00 AC 27 ms 1072 KiB
04_all_01 AC 27 ms 1172 KiB
04_all_02 AC 27 ms 1172 KiB
04_all_03 AC 68 ms 1168 KiB
04_all_04 AC 25 ms 1192 KiB
04_all_05 AC 98 ms 1072 KiB
04_all_06 AC 27 ms 1200 KiB
04_all_07 AC 73 ms 1152 KiB
04_all_08 AC 26 ms 1168 KiB
04_all_09 AC 27 ms 1172 KiB
05_maximal_00 AC 27 ms 1076 KiB
05_maximal_01 AC 27 ms 1176 KiB
05_maximal_02 AC 28 ms 1176 KiB
05_maximal_03 AC 28 ms 1064 KiB
05_maximal_04 AC 29 ms 1168 KiB
05_maximal_05 AC 28 ms 1076 KiB
05_maximal_06 AC 103 ms 1172 KiB
05_maximal_07 AC 30 ms 1176 KiB
05_maximal_08 AC 105 ms 1168 KiB
05_maximal_09 AC 27 ms 1072 KiB
99_handmade_00 AC 27 ms 1072 KiB