oj.uz

Submission #389946

# Submission time Handle Problem Language Result Execution time Memory
389946 2021-04-14T22:18:02 Z Pichon5 Sails (IOI07_sails) C++17
40 / 100
 1000 ms 6488 KB 
#include<bits/stdc++.h>
#define lcm(a,b) (a/__gcd(a,b))*b
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define pb push_back
#define F first
#define S second
#define mp make_pair
//salida rapida "\n"
//DECIMALES fixed<<sp(n)<<x<<endl;
//gcd(a,b)= ax + by
//lCB x&-x
//set.erase(it) - ersases the element present at the required index//auto it = s.find(element)
//set.find(element) - iterator pointing to the given element if it is present else return pointer pointing to set.end()
//set.lower_bound(element) - iterator pointing to element greater than or equal to the given element
//set.upper_bound(element) - iterator pointing to element greater than the given element
// | ^
//__builtin_popcount(x)
using namespace std;

int main()
{
    int n,h,w;
    cin>>n;
    vector<pair<int,int> >v;
    for(int i=0;i<n;i++){
        cin>>h>>w;//altura y cantidad de mastiles
        v.pb({h,w});        
    }
    multiset<int>st;
    sort(v.begin(),v.end());
    for(int i=0;i<n;i++){
        h=v[i].F,w=v[i].S;
        while(st.size()<h)st.insert(0);
        vi aux;
        while(w--){
            auto it = st.begin();
            aux.pb((*it)+1);
            st.erase(it);
        }
        for(auto it : aux){
            st.insert(it);
        }
    }
    ll res=0;
    for(auto it : st){
        res+=(it * (it-1))/2;
    }
    cout<<res<<endl;    
    
    return 0;
}

Compilation message

sails.cpp: In function 'int main()':
sails.cpp:36:24: warning: comparison of integer expressions of different signedness: 'std::multiset<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   36 |         while(st.size()<h)st.insert(0);
      |               ~~~~~~~~~^~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 224 KB Output is correct
2 Correct 18 ms 336 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 529 ms 720 KB Output is correct
2 Correct 412 ms 4940 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1081 ms 1288 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1076 ms 1180 KB Time limit exceeded

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1086 ms 1488 KB Time limit exceeded

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1088 ms 6488 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1090 ms 2364 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1079 ms 2980 KB Time limit exceeded
2 Halted 0 ms 0 KB -