제출 #501420

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
501420		tmn2005	거래 (IZhO13_trading)	C++17	0 / 100	2 ms	332 KiB

trading

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;

#define ar array
#define fr first
#define sc second

#define vec vector
#define ret return

#define ins insert
#define mk make_pair
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front

#define int long long

#define pii pair<int,int>

#define all(s) s.begin(), s.end()
#define allr(s) s.rbegin(), s.rend()

#define NeedForSpeed ios::sync_with_stdio(0),cin.tie(0);
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
const int N=1e6+12,INF=1e9,mod = 1e9+7;
bool iswowel(char n){ n = toupper(n); if(n == 'A' || n == 'O' || n == 'U' || n == 'E' || n == 'I') return true; else return false;}
int n,m,k,x,y,l,r,o,ans,res,ok,mx,mn = INF;
int a[N],b[N],c[N];

int get(int k){
	r = 0;
	for(int i=1; i<=m; i++){
		if(a[i] <= k && k <= b[i]){
			r = max(r, c[i] + (k - a[i]));	
		}
	}
	ret r;
}
main(){
	NeedForSpeed
	freopen("trading.in","r", stdin);
	freopen("trading.out","w", stdout);
    cin>>n>>m;
    for(int i=1; i<=m; i++){
    	cin>>a[i]>>b[i]>>c[i];
	}
	for(int i=1; i<=n; i++){
		cout<<get(i)<<" ";
	}
	cout<<endl;




	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

trading.cpp:43:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   43 | main(){
      | ^~~~
trading.cpp: In function 'int main()':
trading.cpp:45:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |  freopen("trading.in","r", stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
trading.cpp:46:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   46 |  freopen("trading.out","w", stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 100