Submission #1163723


Source Code Expand

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <functional>
#include <cmath>
#include <complex>
#include <cctype>
#include <cassert>
#include <sstream>
#include <ctime>
 
using namespace std;
 
#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()
 
template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }
 
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> P;
typedef vector<pii> vp;

#define INF (1<<29)
#define INFL (1ll<<60)
#define EPS (1e-8)
#define PI (acos(-1))
const ll MOD = 1000000007ll;

int M[2], Q;
vector<pii> B[2];
int dp[112345];

int main() {
	cin >> M[0] >> M[1] >> Q;
	REP(i, Q) {
		int t, d, x;
		scanf("%d %d %d", &t, &d, &x);
		B[d].push_back(pii(t, x));
	}
	
	int ans = 0;
	
	REP(b, 2) {
		priority_queue<pii, vector<pii>, greater<pii> > pq;
		REP(i, B[b].size()) pq.push(B[b][i]);
		
		fill(dp, dp + M[b] + 1, 0);
		dp[0] = INF;
		dp[M[b] + 1] = INF;
		
		while (!pq.empty()) {
			int nt = pq.top().first;
			
			vector<int> beam;
			
			while (!pq.empty()) {
				pii now = pq.top();
				if (now.first != nt) break;
				pq.pop();
				beam.push_back(now.second);
			}
			
			REP(i, beam.size()) dp[beam[i]] = INF;
			
			REP(i, beam.size()) chmin(dp[beam[i]], dp[beam[i] - 1] + 1);
			reverse(ALL(beam));
			REP(i, beam.size()) chmin(dp[beam[i]], dp[beam[i] + 1] + 1);
		}
		
		int mi = INF;
		FOR(i, 1, M[b] + 1) chmin(mi, dp[i]);
		ans += mi;
	}
	
	if (ans == INF) ans = -1;
	cout << ans << endl;
	
	return 0;
}

Submission Info

Submission Time
Task C - ビーム
User tkmst201
Language C++ (GCC 5.4.1)
Score 0
Code Size 1886 Byte
Status WA
Exec Time 43 ms
Memory 2676 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:46:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d", &t, &d, &x);
                                ^

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 0 / 30 0 / 70
Status
AC × 3
AC × 29
WA × 4
AC × 59
WA × 4
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
Subtask1 sample_01.txt, sample_02.txt, sample_03.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, subtask1_30.txt
Subtask2 sample_01.txt, sample_02.txt, sample_03.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, subtask1_30.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, subtask2_30.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
subtask1_01.txt AC 1 ms 256 KB
subtask1_02.txt WA 1 ms 256 KB
subtask1_03.txt AC 1 ms 256 KB
subtask1_04.txt WA 1 ms 256 KB
subtask1_05.txt AC 1 ms 256 KB
subtask1_06.txt AC 1 ms 256 KB
subtask1_07.txt AC 1 ms 256 KB
subtask1_08.txt AC 1 ms 256 KB
subtask1_09.txt AC 1 ms 256 KB
subtask1_10.txt AC 1 ms 256 KB
subtask1_11.txt AC 1 ms 256 KB
subtask1_12.txt AC 1 ms 256 KB
subtask1_13.txt WA 1 ms 256 KB
subtask1_14.txt AC 1 ms 256 KB
subtask1_15.txt AC 1 ms 256 KB
subtask1_16.txt AC 1 ms 256 KB
subtask1_17.txt AC 1 ms 256 KB
subtask1_18.txt WA 1 ms 256 KB
subtask1_19.txt AC 1 ms 256 KB
subtask1_20.txt AC 1 ms 256 KB
subtask1_21.txt AC 1 ms 256 KB
subtask1_22.txt AC 1 ms 256 KB
subtask1_23.txt AC 1 ms 256 KB
subtask1_24.txt AC 1 ms 256 KB
subtask1_25.txt AC 1 ms 256 KB
subtask1_26.txt AC 1 ms 256 KB
subtask1_27.txt AC 1 ms 256 KB
subtask1_28.txt AC 1 ms 256 KB
subtask1_29.txt AC 1 ms 256 KB
subtask1_30.txt AC 1 ms 256 KB
subtask2_01.txt AC 40 ms 1932 KB
subtask2_02.txt AC 40 ms 1968 KB
subtask2_03.txt AC 39 ms 1936 KB
subtask2_04.txt AC 36 ms 2676 KB
subtask2_05.txt AC 35 ms 2028 KB
subtask2_06.txt AC 42 ms 2368 KB
subtask2_07.txt AC 40 ms 1916 KB
subtask2_08.txt AC 37 ms 1900 KB
subtask2_09.txt AC 37 ms 1984 KB
subtask2_10.txt AC 36 ms 1984 KB
subtask2_11.txt AC 38 ms 2548 KB
subtask2_12.txt AC 37 ms 1984 KB
subtask2_13.txt AC 39 ms 1936 KB
subtask2_14.txt AC 40 ms 2032 KB
subtask2_15.txt AC 2 ms 256 KB
subtask2_16.txt AC 1 ms 256 KB
subtask2_17.txt AC 37 ms 1904 KB
subtask2_18.txt AC 41 ms 2420 KB
subtask2_19.txt AC 43 ms 2548 KB
subtask2_20.txt AC 37 ms 1900 KB
subtask2_21.txt AC 39 ms 1876 KB
subtask2_22.txt AC 40 ms 2548 KB
subtask2_23.txt AC 39 ms 1900 KB
subtask2_24.txt AC 38 ms 2016 KB
subtask2_25.txt AC 37 ms 1908 KB
subtask2_26.txt AC 36 ms 1876 KB
subtask2_27.txt AC 37 ms 1968 KB
subtask2_28.txt AC 36 ms 2548 KB
subtask2_29.txt AC 35 ms 1984 KB
subtask2_30.txt AC 39 ms 1984 KB