Submission #54581422

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include<iostream>
#include<vector>
#include<algorithm>
#include<vector>
#include<cmath>
#include<set>
#include<unordered_map>
#include<string>
#include<unordered_set>
#include<queue>
#include<stack>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long  ll;
typedef unsigned long long ull;
int main()
{
    int n,t;
    cin>>n>>t;
    vector<int> a(n);
    for(auto& i:a)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<iostream>
#include<vector>
#include<algorithm>
#include<vector>
#include<cmath>
#include<set>
#include<unordered_map>
#include<string>
#include<unordered_set>
#include<queue>
#include<stack>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long  ll;
typedef unsigned long long ull;
int main()
{
    int n,t;
    cin>>n>>t;
    vector<int> a(n);
    for(auto& i:a)
        cin>>i;
    vector<int> b(n);
    int cur=a[0];
    
    for(int i=0;i<n;i++)
    {
        if(cur<=a[i])
        {
            b[i]=a[i]+t;
            cur=b[i];
        }
        else
        {
            b[i]=cur+t;
            cur=b[i];
        }
    }
    for(auto i:b)
        cout<<i<<endl;
    return 0;
}

Submission Info

Judge Result