제출 #1060177

#제출 시각아이디문제언어결과실행 시간메모리
1060177Zbyszek99Cloud Computing (CEOI18_clo)C++17
0 / 100
1 ms604 KiB
#include <bits/stdc++.h> #define ll long long #define ld long double #define ff first #define ss second #define pii pair<int,int> #define pll pair<long long, long long> #define pb push_back #define rep(i, b) for(int i = 0; i < (b); ++i) #define rep2(i,a,b) for(int i = a; i <= (b); ++i) #define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c) #define count_bits(x) __builtin_popcountll((x)) #define all(x) (x).begin(),(x).end() #define size(x) (int)(x).size() #define forall(it,x) for(auto& it:(x)) using namespace std; //mt19937 mt;void random(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());} //ll rand(ll a, ll b) {return a + (mt() % (b-a+1));} const int INF = 1e9+50; const ll INF_L = 1e18+40; const ll MOD = 1e9+7; int dp[251][251]; void solve() { int n,m; cin >> n; vector<pii> div; vector<pii> zam; rep(i,n) { int c,f,v; cin >> c >> f >> v; div.pb({f,v}); } cin >> m; rep(i,m) { int c,f,v; cin >> c >> f >> v; zam.pb({f,v}); } zam.pb({1e9+1,-1e9}); div.pb({1e9+1,2e9}); sort(all(zam)); reverse(all(zam)); sort(all(div)); reverse(all(div)); int ans = 0; rep2(i,1,m) { rep2(j,1,n) { dp[i][j] = max(dp[i-1][j],dp[i][j-1]); if(div[j].ff >= zam[i].ff) { dp[i][j] = max(dp[i][j],dp[i-1][j-1]+zam[i].ss - div[j].ss); } } } cout << dp[m][n]; } int main() { ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); //random(); int t = 1; // cin >> t; while(t--) solve(); }

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

clo.cpp: In function 'void solve()':
clo.cpp:50:9: warning: unused variable 'ans' [-Wunused-variable]
   50 |     int ans = 0;
      |         ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...