Submission #1442672


Source Code Expand

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <string>
#include <map>
#include <bitset>
#include <vector>
#include <queue>

typedef long long ll;

#define FOR(i,a,b)   for(ll i = (a); i < (b); i++ )
#define REP(i, n)    FOR(i,0,n)
#define fi first
#define se second
const ll mod = 1000000007;
//              123456789

using namespace std;
 

///////////////////////////////////////////////
//
//
///////////////////////////////////////////////

////////////////////////////////////////////////
////////////////////////////////////////////////

int N;
int M;
int S[112345];
int sum = 0;
int ans = 0;
int L, R;
int s;

int main(){
	
	cin>>N>>M;
	
	fill( S, S+112345, 0 );
	
	REP( i, N ){
		scanf("%d %d %d", &L, &R, &s);
		sum += s;
		L--;
		S[L] += s;
		S[R] -= s;
	}
	
	FOR( i, 1, M+1 ){
		S[i] += S[i-1];
	}
	
	REP( i, M ){
		ans = max( ans, sum-S[i] );
	}
	
	cout<<ans<<endl;
	
	return 0;
}

Submission Info

Submission Time
Task C - ハイスコア
User Ice_in_juice
Language C++14 (GCC 5.4.1)
Score 101
Code Size 996 Byte
Status AC
Exec Time 25 ms
Memory 768 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", &L, &R, &s);
                                ^

Judge Result

Set Name Sample Subtask1 Subtask2 Subtask3
Score / Max Score 0 / 0 30 / 30 70 / 70 1 / 1
Status
AC × 3
AC × 23
AC × 43
AC × 63
Set Name Test Cases
Sample subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.txt
Subtask1 subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.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
Subtask2 subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.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, 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
Subtask3 subtask0-sample01.txt, subtask0-sample02.txt, subtask0-sample03.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, 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, subtask3-01.txt, subtask3-02.txt, subtask3-03.txt, subtask3-04.txt, subtask3-05.txt, subtask3-06.txt, subtask3-07.txt, subtask3-08.txt, subtask3-09.txt, subtask3-10.txt, subtask3-11.txt, subtask3-12.txt, subtask3-13.txt, subtask3-14.txt, subtask3-15.txt, subtask3-16.txt, subtask3-17.txt, subtask3-18.txt, subtask3-19.txt, subtask3-20.txt
Case Name Status Exec Time Memory
subtask0-sample01.txt AC 1 ms 640 KB
subtask0-sample02.txt AC 1 ms 640 KB
subtask0-sample03.txt AC 1 ms 640 KB
subtask1-01.txt AC 1 ms 640 KB
subtask1-02.txt AC 1 ms 640 KB
subtask1-03.txt AC 1 ms 640 KB
subtask1-04.txt AC 1 ms 640 KB
subtask1-05.txt AC 1 ms 640 KB
subtask1-06.txt AC 1 ms 640 KB
subtask1-07.txt AC 1 ms 640 KB
subtask1-08.txt AC 1 ms 640 KB
subtask1-09.txt AC 1 ms 640 KB
subtask1-10.txt AC 1 ms 640 KB
subtask1-11.txt AC 1 ms 640 KB
subtask1-12.txt AC 1 ms 640 KB
subtask1-13.txt AC 1 ms 640 KB
subtask1-14.txt AC 1 ms 640 KB
subtask1-15.txt AC 1 ms 640 KB
subtask1-16.txt AC 1 ms 640 KB
subtask1-17.txt AC 1 ms 640 KB
subtask1-18.txt AC 1 ms 640 KB
subtask1-19.txt AC 1 ms 640 KB
subtask1-20.txt AC 1 ms 640 KB
subtask2-01.txt AC 1 ms 640 KB
subtask2-02.txt AC 1 ms 640 KB
subtask2-03.txt AC 1 ms 640 KB
subtask2-04.txt AC 2 ms 640 KB
subtask2-05.txt AC 2 ms 640 KB
subtask2-06.txt AC 2 ms 640 KB
subtask2-07.txt AC 2 ms 640 KB
subtask2-08.txt AC 2 ms 640 KB
subtask2-09.txt AC 2 ms 640 KB
subtask2-10.txt AC 2 ms 640 KB
subtask2-11.txt AC 2 ms 640 KB
subtask2-12.txt AC 2 ms 640 KB
subtask2-13.txt AC 2 ms 640 KB
subtask2-14.txt AC 2 ms 640 KB
subtask2-15.txt AC 2 ms 640 KB
subtask2-16.txt AC 2 ms 640 KB
subtask2-17.txt AC 2 ms 640 KB
subtask2-18.txt AC 2 ms 640 KB
subtask2-19.txt AC 2 ms 640 KB
subtask2-20.txt AC 2 ms 640 KB
subtask3-01.txt AC 6 ms 640 KB
subtask3-02.txt AC 13 ms 640 KB
subtask3-03.txt AC 20 ms 640 KB
subtask3-04.txt AC 25 ms 640 KB
subtask3-05.txt AC 25 ms 640 KB
subtask3-06.txt AC 25 ms 640 KB
subtask3-07.txt AC 25 ms 640 KB
subtask3-08.txt AC 25 ms 640 KB
subtask3-09.txt AC 25 ms 640 KB
subtask3-10.txt AC 25 ms 640 KB
subtask3-11.txt AC 25 ms 640 KB
subtask3-12.txt AC 25 ms 640 KB
subtask3-13.txt AC 25 ms 640 KB
subtask3-14.txt AC 25 ms 640 KB
subtask3-15.txt AC 25 ms 640 KB
subtask3-16.txt AC 25 ms 640 KB
subtask3-17.txt AC 25 ms 768 KB
subtask3-18.txt AC 25 ms 640 KB
subtask3-19.txt AC 25 ms 640 KB
subtask3-20.txt AC 25 ms 640 KB