# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
533886 | idas | Sails (IOI07_sails) | C++11 | 62 ms | 5036 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#define FAST_IO ios_base::sync_with_stdio(0); cin.tie(nullptr); cout.tie(nullptr)
#define FOR(i, begin, end) for(int i = (begin); i < (end); i++)
#define TSTS int ttt; cin >> ttt; while(ttt--) solve()
#define all(x) (x).begin(), (x).end()
#define le(vec) vec[vec.size()-1]
#define sz(x) ((int)((x).size()))
#define pb push_back
#define s second
#define f first
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef map<int, int> mii;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long double, long double> pdd;
const int INF=1e9, MOD=1e9+7, mod=998244353;
const ll LINF=1e13;
void setIO()
{
FAST_IO;
}
void setIO(string s)
{
FAST_IO;
freopen((s+".in").c_str(), "r", stdin);
freopen((s+".out").c_str(), "w", stdout);
}
const int N=1e5+10;
set<int> st;
int n, sm;
ll p[N];
pii find_seg(int nd)
{
return {*prev(st.lower_bound(nd)), *st.lower_bound(nd)};
}
void add(int i)
{
p[i]++; sm++;
if(p[i]==0){
st.erase(i);
}
}
void neg(int i)
{
p[i]--; sm--;
if(p[i]==-1){
st.insert(i);
}
}
int main()
{
setIO();
cin >> n;
vector<pii> inf;
int mx=0;
FOR(i, 0, n)
{
int h, k;
cin >> h >> k;
inf.pb({h,k});
mx=max(mx, h);
}
sort(all(inf));
int lst=-1;
st.insert(1);
for(auto[h, k] : inf){
if(h>lst){
st.insert(h+1);
p[lst+1]-=sm;
if(p[lst+1]==0) st.erase(lst+1);
lst=h;
}
int nd=lst-k+1;
pii curs=find_seg(nd);
if(st.count(nd)){
add(nd); neg(lst+1);
}
else{
add(curs.s); neg(lst+1);
int dif=curs.s-nd;
add(curs.f); neg(curs.f+dif);
}
}
ll ans=0;
FOR(i, 1, mx+1)
{
p[i]+=p[i-1];
ans+=p[i]*(p[i]-1)/2;
}
cout << ans;
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |