oj.uz

답안 #167894

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
167894 2019-12-10T17:46:04 Z theStaticMind Semiexpress (JOI17_semiexpress) C++14
100 / 100
 20 ms 6136 KB 
#include<bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define ii pair<int,int>
#define all(x) (x).begin(),(x).end()
#define INF 100000000000000000
#define modulo 1000000007
#define mod 998244353
#define int long long int
using namespace std;

int32_t main(){
      ios_base::sync_with_stdio(false);
      cin.tie(NULL);
   //   freopen("q.gir","r",stdin);
   //   freopen("q.cik","w",stdout);
      int n,m,k,A,B,C,T,ans=-1;
      cin>>n>>m>>k>>A>>B>>C>>T;k-=m;
      vector<int>arr(m);
      vector<queue<int>>knap;
      vector<int>dp(k+1,0);
      for(int i=0;i<m;i++)cin>>arr[i];
      for(int i=1;i<m;i++){
            int L=arr[i-1];
            int R=arr[i];
            int time=(L-1)*B;
            int last=L;
            int put=0;
            int cnt=0;
            queue<int>Q;
            if(time>T)break;
            while(last<R&&put<=k&&time<=T){
                  int c=min((T-time)/A+1,R-last);
                  cnt+=c;
                  time+=c*C;
                  if(put==0)ans+=c;
                  else
                  Q.push(c);
                  put++;
                  last+=c;
            }
            if(!Q.empty())
            knap.pb(Q);
      }
      if((n-1)*B<=T)ans++;
      priority_queue<ii>Q;
      for(int i=0;i<knap.size();i++){
            Q.push({knap[i].front(),i});
            knap[i].pop();
      }
      while(k--&&!Q.empty()){
            ans+=Q.top().first;
            int x=Q.top().second;
            Q.pop();
            if(!knap[x].empty()){
                  Q.push({knap[x].front(),x});
                  knap[x].pop();
            }
      }
      cout<<ans;
}

Compilation message

semiexpress.cpp: In function 'int32_t main()':
semiexpress.cpp:47:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for(int i=0;i<knap.size();i++){
                   ~^~~~~~~~~~~~

Subtask #1
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct

Subtask #3
52.0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 3 ms 632 KB Output is correct
23 Correct 20 ms 6136 KB Output is correct
24 Correct 4 ms 1784 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 3 ms 376 KB Output is correct
27 Correct 4 ms 1784 KB Output is correct
28 Correct 4 ms 1784 KB Output is correct
29 Correct 12 ms 2936 KB Output is correct
30 Correct 9 ms 2424 KB Output is correct