| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1340100 | asim | Skare (COCI26_skare) | C++20 | 1 ms | 344 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define all(v) v.begin(), v.end()
void solve() {
int n, k; cin >> n >> k;
vector<int> vt = {n};
while(k--) {
int x, l; cin >> x >> l;
x--;
vector<int> vt2;
for(int i = 0; i < x; i++) {
vt2.pb(vt[i]);
}
int a = vt[x];
vt2.pb(l), vt2.pb(a - l);
for(int i = x + 1; i < vt.size(); i++) {
vt2.pb(vt[i]);
}
vt = vt2;
}
set<int> st(all(vt));
cout << st.size() << '\n';
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int T = 1;
//cin >> T;
while (T--) solve();
}| # | 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... | ||||
