Submission #739004
Source Code Expand
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#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))
#define push_back PB
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
using namespace std;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll; typedef map<int, int> mii;
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; }
main(){
int i,j;
int n,q;
int l,r;
long int t;
long int a[100];
scanf("%d%d",&n,&q);
for(i=0;i<n;i++){
a[i]=0;
}
for(i=0;i<q;i++){
scanf("%d%d%ld",&l,&r,&t);
//cin>>l>>r>>t;
for(j=l-1;j<r;j++){
a[j]=t;
}
}
for(i=0;i<n;i++){
cout<<a[i]<<endl;
}
}
Submission Info
Submission Time
2016-05-23 09:02:29+0900
Task
B - 編集
User
Chikuwa
Language
C++14 (GCC 5.4.1)
Score
100
Code Size
1262 Byte
Status
AC
Exec Time
5 ms
Memory
384 KiB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:38:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&n,&q);
^
./Main.cpp:44:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%ld",&l,&r,&t);
^
Judge Result
Set Name
sample
All
Score / Max Score
0 / 0
100 / 100
Status
Set Name
Test Cases
sample
sample01.txt, sample02.txt
All
00.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, sample01.txt, sample02.txt
Case Name
Status
Exec Time
Memory
00.txt
AC
4 ms
256 KiB
01.txt
AC
4 ms
256 KiB
02.txt
AC
4 ms
256 KiB
03.txt
AC
4 ms
256 KiB
04.txt
AC
4 ms
256 KiB
05.txt
AC
4 ms
256 KiB
06.txt
AC
4 ms
256 KiB
07.txt
AC
4 ms
256 KiB
08.txt
AC
4 ms
256 KiB
09.txt
AC
4 ms
256 KiB
10.txt
AC
4 ms
256 KiB
11.txt
AC
4 ms
256 KiB
12.txt
AC
5 ms
256 KiB
13.txt
AC
5 ms
256 KiB
14.txt
AC
5 ms
256 KiB
15.txt
AC
5 ms
256 KiB
16.txt
AC
4 ms
256 KiB
17.txt
AC
5 ms
384 KiB
18.txt
AC
4 ms
256 KiB
19.txt
AC
5 ms
256 KiB
sample01.txt
AC
4 ms
256 KiB
sample02.txt
AC
4 ms
256 KiB