#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define PI acos(-1)
#define ld long double
template <class T> bool ckmin(T& a, const T& b) {return a > b ? a = b, true : false;}
template <class T> bool ckmax(T& a, const T& b) {return a < b ? a = b, true : false;}
const int mod = 1e9+7, N = 2e5+5;
int msb(int val){return sizeof(int)*8-__builtin_clzll(val);}
int a[N], n, m, k;
void solve(int test_case){
int i, j;
cin >> n;
vector<int> v;
int now = 1;
int c=0, dest=1;
bool ch = false;
for(i=0;v.size() < n;i++){
if(ch && now%2==1)now--;
else if(now > 1)now--;
while(c < dest)c++,v.pb(now), now+=2;
c=0;
dest++;
if(v.back()%2==1)ch = true;
}
// for(auto x : v)cout << x << ' ';
cout << v[n-1] << '\n';
return;
}
signed main(){
FASTIO;
#define MULTITEST 0
#if MULTITEST
int _T;
cin >> _T;
for(int T_CASE = 1; T_CASE <= _T; T_CASE++)
solve(T_CASE);
#else
solve(1);
#endif
return 0;
}
Compilation message
oddeven.cpp: In function 'void solve(long long int)':
oddeven.cpp:25:19: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
25 | for(i=0;v.size() < n;i++){
| ~~~~~~~~~^~~
oddeven.cpp:19:9: warning: unused variable 'j' [-Wunused-variable]
19 | int i, j;
| ^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Correct |
0 ms |
364 KB |
Output is correct |
| 3 |
Correct |
0 ms |
364 KB |
Output is correct |
| 4 |
Correct |
11 ms |
8672 KB |
Output is correct |
| 5 |
Correct |
45 ms |
33400 KB |
Output is correct |
| 6 |
Runtime error |
270 ms |
262148 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
| 7 |
Halted |
0 ms |
0 KB |
- |
