oj.uz

답안 #337845

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
337845 2020-12-22T03:00:17 Z beksultan04 홀-짝 수열 (IZhO11_oddeven) C++14
0 / 100
 1 ms 364 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scan1(a) scanf("%lld",&a);
#define scan2(a,b) scanf("%lld %lld",&a, &b);
#define scan3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
const int N = 1e6+12,INF=1e9+7;
int n;
bool is(int x){
    x = (x*(x+1))/2;
    ret x >= n;
}


main(){
    int i,c=1,cnt=0,l=1,r=INF;
    scan1(n)
    if( n == 1){
        cout <<1;
        ret 0;
    }
    while (r-l>1){
        int m = l+r>>1;
        if (is(m))r=m;
        else l=m;
    }
    if (is(r))l=r;
    c = l*l;
    cnt = r*(r+1)>>1;

    c -= (cnt-n)*2;
    cout <<c;


}

Compilation message

oddeven.cpp:27:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   27 | main(){
      |      ^
oddeven.cpp: In function 'int main()':
oddeven.cpp:35:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   35 |         int m = l+r>>1;
      |                 ~^~
oddeven.cpp:28:9: warning: unused variable 'i' [-Wunused-variable]
   28 |     int i,c=1,cnt=0,l=1,r=INF;
      |         ^
oddeven.cpp:11:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   11 | #define scan1(a) scanf("%lld",&a);
      |                  ~~~~~^~~~~~~~~~~
oddeven.cpp:29:5: note: in expansion of macro 'scan1'
   29 |     scan1(n)
      |     ^~~~~

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 0 ms 364 KB Output is correct
13 Incorrect 0 ms 364 KB Output isn't correct
14 Halted 0 ms 0 KB -