oj.uz

Submission #209466

# Submission time Handle Problem Language Result Execution time Memory
209466 2020-03-14T09:54:40 Z balbit Vision Program (IOI19_vision) C++14
0 / 100
 6 ms 256 KB 
#include <bits/stdc++.h>
#include "vision.h"
using namespace std;
#define ll long long
#define ALL(x) x.begin(),x.end()
#define SZ(x) x.size()
#define pb push_back


#ifdef BALBIT
#define bug(...) cerr<<"#"<<__LINE__<<": "<<#__VA_ARGS__<<": ",_do(__VA_ARGS__)
template<typename T> void _do(T &&x) {cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T && x, S && ...y){cerr<<x<<", "; _do(y...);}
#define IOS()
#else
#define IOS() ios::sync_with_stdio(0)
#define endl '\n'
#define bug(...)
#endif // BALBIT

const int maxn = 1e5;

int n, m;

inline int id(int r, int c){
    return r * m + c;
}

void construct_network(int N, int M, int K){
    n = N; m = M;
    vector<int> xpos;
    for (int i = 0; i<1; i++) {
        for (int j = 0; j<1; j++) {
            vector<int> ask;
            bug(i,j);
            for (int k = max(j-K,0); k<=min(j+K-1,m-1); ++k) {
                int h = i + (K - abs(j-k));
                if (h >= 0 && h < n) {
                    ask.pb(id(h,k));
                    bug("asking",h,k);
                }
            }
//            if (i == n-1 && j == m-1) {
//                for (int x: xpos) ask.pb(x);
//            }
            if (ask.size() == 0) continue;
            int T = add_xor(ask);
            int S = add_and({T,id(i,j)});
            xpos.pb(S);
        }
    }
    int ans = add_xor(xpos);

}
/*
signed main(){
    IOS();

}
*/

Compilation message

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:52:9: warning: unused variable 'ans' [-Wunused-variable]
     int ans = add_xor(xpos);
         ^~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 KB WA in grader: Instruction with no inputs
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 KB WA in grader: Instruction with no inputs
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 KB WA in grader: Instruction with no inputs
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 KB WA in grader: Instruction with no inputs
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 KB WA in grader: Instruction with no inputs
2 Halted 0 ms 0 KB -

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 256 KB on inputs (0, 0), (0, 1), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 KB on inputs (80, 199), (81, 199), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 KB WA in grader: Instruction with no inputs
2 Halted 0 ms 0 KB -