oj.uz

Submission #1002749

# Submission time Handle Problem Language Result Execution time Memory
1002749 2024-06-19T19:18:41 Z Deepesson MalnaRISC (COI21_malnarisc) C++17
0 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>
typedef std::pair<int,int> pii;
int main()
{
    int n;
    std::cin>>n;
    int oldn=n;
    int truenum=2;
    while(truenum<n){
        truenum*=2;
    }
    n=truenum;
    std::vector<std::vector<pii>> ans;
    for (int k = 2; k <= n; k *= 2){ // k is doubled every iteration
        for (int j = k/2; j > 0; j /= 2){ // j is halved at every iteration, with truncation of fractional parts
            std::vector<pii> tp;
            for (int i = 0; i < n; i++){
                int l = i ^ j;
                if (l > i)
                    if ( (i&k == 0)){
                        if(std::max(l+1,i+1)<=oldn)
                        tp.push_back({l+1,i+1});
                    }else {
                        if(std::max(l+1,i+1)<=oldn)
                        tp.push_back({i+1,l+1});

                    }
            }
            if(tp.size()){
                ans.push_back(tp);
            }
        }
    }
    std::cout<<ans.size()<<"\n";
    for(auto&x:ans){
        for(auto&y:x)std::cout<<"CMPSWP R"<<y.first<<" R"<<y.second<<" ";
        std::cout<<"\n";
    }
}

Compilation message

malnarisc.cpp: In function 'int main()':
malnarisc.cpp:20:31: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
   20 |                     if ( (i&k == 0)){
      |                             ~~^~~~
malnarisc.cpp:19:20: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else]
   19 |                 if (l > i)
      |                    ^

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB not sorted
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB not sorted
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB not sorted
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB not sorted
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB not sorted
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB not sorted
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB not sorted
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB not sorted
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB not sorted
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB not sorted
2 Halted 0 ms 0 KB -