oj.uz

답안 #475124

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
475124 2021-09-21T08:41:22 Z Mr_Ph Po (COCI21_po) C++14
20 / 70
 39 ms 5284 KB 
///made by : Mr_Ph :D
#include<bits/stdc++.h>
#include<unordered_map>
typedef long long ll;
typedef long long int lli;
typedef unsigned long long ull;
using namespace std;
const double PI=acos(-1.0);
const ll mod=(ll)1e9+7;
//int dx[4] = {0, 0, 1, -1};
//int dy[4] = {1, -1, 0, 0};
///the defines :)
#define endl '\n'
#define vi vector<int>
#define vll vector<ll>
#define lower(s) transform(s.begin(),s.end(),s.begin(),::tolower)
#define upper(s) transform(s.begin(),s.end(),s.begin(),::toupper)
#define ent(arr) for(int i=0;i<arr.size();i++)cin>>arr[i];
#define all(arr) arr.begin(),arr.end()
#define allr(arr) arr.rbegin(),arr.rend()
#define sz size()
///the end of the defines ;)
void solve()
{
    int n;
    cin>>n;
    vi arr(n);
    ent(arr);
    ll cnt=0;
    if(n<10000){
    for(int i=0;i<n;i++)
    {
        //cout<<arr[i]<<" ";
        if(arr[i]==0)
            continue;
        ll e=arr[i];
        for(int j=i;j<n;j++)
        {
            if(arr[j]<e)
                break;
            arr[j]-=e;
        }
        cnt++;
    }
    cout<<cnt<<endl;
    }
    else
    {
        set<int>st;
        for(int i=0;i<n;i++)st.insert(arr[i]);
        cout<<st.sz<<endl;
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    //freopen("window.in","r",stdin);
    //freopen("output.txt","w",stdout);
    int t=1;//int st;
    //cin>>t;//cin>>st;
    while(t--)
        solve();
}

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:18:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 | #define ent(arr) for(int i=0;i<arr.size();i++)cin>>arr[i];
      |                              ~^~~~~~~~~~~
Main.cpp:28:5: note: in expansion of macro 'ent'
   28 |     ent(arr);
      |     ^~~

Subtask #1
20.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Incorrect 5 ms 460 KB Output isn't correct
5 Incorrect 8 ms 588 KB Output isn't correct
6 Correct 26 ms 3044 KB Output is correct
7 Incorrect 39 ms 5284 KB Output isn't correct