Submission #1338368

#TimeUsernameProblemLanguageResultExecution timeMemory
1338368poapaa.Infinite Race (EGOI24_infiniterace2)C++20
51 / 100
1095 ms1980 KiB
#include <iostream>
#include <vector>

using namespace std;

int main() {
    int n, q, i, x;
    int crossings = 0;

    if( !( cin >> n >> q ) ) {
        return 0;
    }

    vector<int> last_pos( n, 0 );
    vector<int> current_lap( n, 0 );

    for( i = 1; i <= q; i++ ) {
        cin >> x;
        if( x > 0 ) {
            if( last_pos[x] == 1 ) {
                crossings++;
                for( int j = 1; j < n; j++ ) {
                    last_pos[j] = 0;
                }
            }
            last_pos[x] = 1;
        } else {
            int p = -x;
            last_pos[p] = -1;
        }
    }

    cout << crossings << endl;

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...