Submission #1059883

#	Time	Username	Problem	Language	Result	Execution time	Memory
1059883		YassineBenYounes	Vision Program (IOI19_vision)	C++17	44 / 100	69 ms	8416 KiB

vision

#include<bits/stdc++.h>
#include<chrono>
#include<random>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (PGCD)
ll lcm(ll a , ll b) {return (a * b) / gcd(a , b);} // least common multiple (PPCM)
int dx[8] = {1, 0, 0, -1, 1, 1, -1, -1};
int dy[8] = {0, 1, -1, 0, 1, -1, -1, 1};
#define endl "\n"
#define ss second
#define ff first
#define all(x) (x).begin() , (x).end()
#define pb push_back
#define vi vector<int>
#define vii vector<pair<int,int>>
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd  pair<double,double>
#define vdd  vector<pdd>
#define speed ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pbds tree<pii, null_type, less<pii>,rb_tree_tag, tree_order_statistics_node_update>
using namespace __gnu_pbds;
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
////////////////////Only Clear Code//////////////////////////
 
void usaco_problem(){
    freopen("milkvisits.in", "r", stdin);
    freopen("milkvisits.out", "w", stdout);
}
 
void init(){
    #ifndef ONLINE_JUDGE
 
freopen("input.txt", "r", stdin);
 
freopen("output.txt", "w", stdout);
 
#endif // ONLINE_JUDGE
}
const int mx = 3e5+5;
const int LOG = 22;
const int inf = 1e9;
const ll mod = 1e9+7;
const int sq = 320;
 
#include "vision.h"
int n, m, k;
/*
int ind = 0;
int last = 0;
int arr[mx];
 
int add_not(int x){
    int y = !x;
    last = y;
    arr[ind] = y;
    return ind++;
}
 
int add_and(vi v){
    int y = 1;
    for(int i : v){
        y &= arr[i];
    }
    last = y;
    arr[ind] = y;
    return ind++;
}
 
int add_or(vi v){
    int y = 0;
    for(int i : v){
        y |= arr[i];
    }
    last = y;
    arr[ind] = y;
    return ind++;
}
 
int add_xor(vi v){
    int y = 0;
    for(int i : v){
        y ^= arr[i];
    }
    last = y;
    arr[ind] = y;
    return ind++;
}*/
void construct_network(int H, int W, int K) {
    n=H,m=W,k=K;
    int cur = n*m;
    vi ans;
    pbds s;
    for(int i = 0; i < n;i++){
        for(int j = 0;j < m;j++){
            s.insert({i, j});
        }
    }
    int cnt = 0;
    while(cnt <= 9997){
        if(s.empty())break;
        int ind = rng() % s.size();
        pii p = *s.find_by_order(ind);
        int i = p.ff, j = p.ss;
        s.erase({i, j});
        vi v;
        for(int addx = 0;addx <= k;addx++){
            int addy = k-addx;
            int nx = i + addx, ny = j + addy;
            if(nx >= 0 && nx < n && ny >= 0 && ny < m){
                v.pb(nx*m+ny);
            }
            addy = -k+addx;
            nx = i + addx, ny = j + addy;
            if(nx >= 0 && nx < n && ny >= 0 && ny < m){
                v.pb(nx*m+ny);
            }
            int add1x = -addx;
            addy = k-addx;
            nx = i + add1x, ny = j + addy;
            if(nx >= 0 && nx < n && ny >= 0 && ny < m){
                v.pb(nx*m+ny);
            }
            addy = -k+addx;
            nx = i + add1x, ny = j + addy;
            if(nx >= 0 && nx < n && ny >= 0 && ny < m){
                v.pb(nx*m+ny);
            }
        }
        if(!v.empty()){
            int x = add_or(v);
            cnt++;
            int y = add_and({x, i*m+j});
            cnt++;
            ans.pb(y);
        }
    }
    int x = add_or(ans);
}
/*
int32_t main(){
    init();
    speed;
    arr[0] = 1;
    arr[5] = 1;
    ind = 3*2;
    construct_network(2, 3, 2);
    cout << last << endl;
}*/
 
/*
    NEVER GIVE UP!
    DOING SMTHNG IS BETTER THAN DOING NTHNG!!!
    Your Guide when stuck:
    - Continue keyword only after reading the whole input
    - Don't use memset with testcases
    - Check for corner cases(n=1, n=0)
    - Check where you declare n(Be careful of declaring it globally and in main)
*/

Compilation message (stderr)

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:100:9: warning: unused variable 'cur' [-Wunused-variable]
  100 |     int cur = n*m;
      |         ^~~
vision.cpp:147:9: warning: unused variable 'x' [-Wunused-variable]
  147 |     int x = add_or(ans);
      |         ^
vision.cpp: In function 'void usaco_problem()':
vision.cpp:36:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |     freopen("milkvisits.in", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vision.cpp:37:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |     freopen("milkvisits.out", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vision.cpp: In function 'void init()':
vision.cpp:43:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 | freopen("input.txt", "r", stdin);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
vision.cpp:45:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 | freopen("output.txt", "w", stdout);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 11 / 11
• Subtask 3: 11 / 11
• Subtask 4: 0 / 15
• Subtask 5: 12 / 12
• Subtask 6: 0 / 8
• Subtask 7: 0 / 14
• Subtask 8: 0 / 19